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/sum10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:25:04,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:25:04,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:25:04,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:25:04,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:25:04,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:25:04,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:25:04,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:25:04,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:25:04,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:25:04,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:25:04,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:25:04,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:25:04,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:25:04,507 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:25:04,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:25:04,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:25:04,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:25:04,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:25:04,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:25:04,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:25:04,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:25:04,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:25:04,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:25:04,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:25:04,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:25:04,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:25:04,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:25:04,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:25:04,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:25:04,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:25:04,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:25:04,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:25:04,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:25:04,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:25:04,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:25:04,526 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:04,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:25:04,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:25:04,552 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:25:04,552 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:25:04,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:25:04,554 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:25:04,554 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:25:04,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:25:04,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:25:04,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:25:04,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:25:04,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:25:04,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:25:04,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:25:04,556 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:25:04,557 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:25:04,557 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:25:04,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:25:04,557 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:25:04,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:25:04,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:25:04,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:25:04,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:25:04,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:25:04,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:04,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:25:04,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:25:04,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:25:04,560 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:25:04,560 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:25:04,561 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:25:04,561 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:25:04,561 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:25:04,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:25:04,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:25:04,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:25:04,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:25:04,637 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:25:04,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-23 10:25:04,706 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9cbe8d/e091d3837ba94b9f82484401b5d6fe56/FLAGb61183401 [2018-11-23 10:25:05,171 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:25:05,172 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-23 10:25:05,179 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9cbe8d/e091d3837ba94b9f82484401b5d6fe56/FLAGb61183401 [2018-11-23 10:25:05,517 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca9cbe8d/e091d3837ba94b9f82484401b5d6fe56 [2018-11-23 10:25:05,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:25:05,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:25:05,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:05,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:25:05,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:25:05,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:05" (1/1) ... [2018-11-23 10:25:05,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b3cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:05, skipping insertion in model container [2018-11-23 10:25:05,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:05" (1/1) ... [2018-11-23 10:25:05,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:25:05,570 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:25:05,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:05,859 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:25:05,900 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:05,921 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:25:05,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:05 WrapperNode [2018-11-23 10:25:05,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:05,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:05,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:25:05,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:25:05,933 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:05" (1/1) ... [2018-11-23 10:25:05,949 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:05" (1/1) ... [2018-11-23 10:25:05,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:05,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:25:05,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:25:05,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:25:05,970 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:05" (1/1) ... [2018-11-23 10:25:05,970 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:05" (1/1) ... [2018-11-23 10:25:05,974 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:05" (1/1) ... [2018-11-23 10:25:05,975 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:05" (1/1) ... [2018-11-23 10:25:06,010 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:05" (1/1) ... [2018-11-23 10:25:06,019 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:05" (1/1) ... [2018-11-23 10:25:06,021 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:05" (1/1) ... [2018-11-23 10:25:06,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:25:06,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:25:06,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:25:06,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:25:06,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:06,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:25:06,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:25:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:25:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:25:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:25:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:25:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 10:25:06,154 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 10:25:06,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:25:06,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:25:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:25:06,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:25:06,769 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:25:06,769 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:25:06,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:06 BoogieIcfgContainer [2018-11-23 10:25:06,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:25:06,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:25:06,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:25:06,773 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:25:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:05" (1/3) ... [2018-11-23 10:25:06,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68318bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:06, skipping insertion in model container [2018-11-23 10:25:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:05" (2/3) ... [2018-11-23 10:25:06,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68318bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:06, skipping insertion in model container [2018-11-23 10:25:06,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:06" (3/3) ... [2018-11-23 10:25:06,777 INFO L112 eAbstractionObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-11-23 10:25:06,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:25:06,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:25:06,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:25:06,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:25:06,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:25:06,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:25:06,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:25:06,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:25:06,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:25:06,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:25:06,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:25:06,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:25:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:25:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:06,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:06,868 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:06,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:06,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 10:25:06,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:06,880 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:06,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:07,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:07,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:25:07,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-23 10:25:07,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:25:07,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 10:25:07,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 10:25:07,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {34#true} is VALID [2018-11-23 10:25:07,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 10:25:07,232 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:07,232 INFO L273 TraceCheckUtils]: 8: 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:07,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:07,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:07,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:07,233 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {35#false} #70#return; {35#false} is VALID [2018-11-23 10:25:07,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:25:07,234 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:07,234 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:07,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:07,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:07,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:07,235 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #72#return; {35#false} is VALID [2018-11-23 10:25:07,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {35#false} is VALID [2018-11-23 10:25:07,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:07,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:25:07,236 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:07,237 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:07,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:07,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:07,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:07,238 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #74#return; {35#false} is VALID [2018-11-23 10:25:07,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 10:25:07,239 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:07,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:25:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:25:07,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:07,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:07,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:25:07,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:07,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:25:07,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:07,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:25:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:25:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:25:07,473 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 10:25:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:07,676 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 10:25:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:25:07,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:25:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:25:07,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 10:25:07,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:07,932 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:25:07,932 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:25:07,936 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:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:25:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:25:07,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:07,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,994 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,994 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,000 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:25:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:08,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,002 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:08,002 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,007 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:25:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:08,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:08,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:25:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 10:25:08,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 10:25:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:08,014 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 10:25:08,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:25:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:08,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:08,016 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:08,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:08,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:08,017 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 10:25:08,018 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:08,018 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:08,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:08,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:08,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 10:25:08,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {291#true} is VALID [2018-11-23 10:25:08,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 10:25:08,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #66#return; {291#true} is VALID [2018-11-23 10:25:08,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret12 := main(); {291#true} is VALID [2018-11-23 10:25:08,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {311#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:25:08,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 10bv32); {292#false} is VALID [2018-11-23 10:25:08,324 INFO L256 TraceCheckUtils]: 7: Hoare triple {292#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:08,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:25:08,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} assume !~bvslt32(~i~0, 10bv32); {292#false} is VALID [2018-11-23 10:25:08,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:08,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:08,326 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {292#false} {292#false} #70#return; {292#false} is VALID [2018-11-23 10:25:08,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {292#false} is VALID [2018-11-23 10:25:08,326 INFO L256 TraceCheckUtils]: 14: Hoare triple {292#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:08,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:25:08,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !~bvslt32(~i~0, 10bv32); {292#false} is VALID [2018-11-23 10:25:08,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:08,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:08,328 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {292#false} {292#false} #72#return; {292#false} is VALID [2018-11-23 10:25:08,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {292#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {292#false} is VALID [2018-11-23 10:25:08,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {292#false} assume !~bvslt32(~i~2, 9bv32); {292#false} is VALID [2018-11-23 10:25:08,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {292#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {292#false} is VALID [2018-11-23 10:25:08,335 INFO L256 TraceCheckUtils]: 23: Hoare triple {292#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:08,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:25:08,336 INFO L273 TraceCheckUtils]: 25: Hoare triple {292#false} assume !~bvslt32(~i~0, 10bv32); {292#false} is VALID [2018-11-23 10:25:08,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:08,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:08,337 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {292#false} {292#false} #74#return; {292#false} is VALID [2018-11-23 10:25:08,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {292#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {292#false} is VALID [2018-11-23 10:25:08,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {292#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {292#false} is VALID [2018-11-23 10:25:08,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 10:25:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:25:08,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:08,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:08,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:25:08,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:08,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:08,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:08,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:08,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:08,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:08,583 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 10:25:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,799 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 10:25:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:08,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:25:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:25:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:25:08,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 10:25:08,978 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:08,980 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:25:08,981 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:25:08,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:25:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 10:25:09,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:09,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:09,004 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:09,005 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,008 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:25:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:25:09,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,010 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 10:25:09,010 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 10:25:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,013 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:25:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:25:09,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:09,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:25:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 10:25:09,017 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 10:25:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:09,018 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 10:25:09,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:25:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 10:25:09,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:09,020 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, 1, 1] [2018-11-23 10:25:09,020 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:09,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 10:25:09,021 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:09,021 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:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:09,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:09,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:25:09,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {548#true} is VALID [2018-11-23 10:25:09,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:09,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:25:09,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:25:09,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {548#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {568#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:25:09,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {568#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:25:09,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {575#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:09,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {575#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10bv32); {549#false} is VALID [2018-11-23 10:25:09,237 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:09,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:25:09,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {549#false} assume !~bvslt32(~i~0, 10bv32); {549#false} is VALID [2018-11-23 10:25:09,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:09,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:09,239 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {549#false} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:25:09,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {549#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:25:09,240 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:09,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:25:09,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {549#false} assume !~bvslt32(~i~0, 10bv32); {549#false} is VALID [2018-11-23 10:25:09,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:09,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:09,241 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {549#false} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:25:09,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {549#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {549#false} is VALID [2018-11-23 10:25:09,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 9bv32); {549#false} is VALID [2018-11-23 10:25:09,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:25:09,243 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:09,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:25:09,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {549#false} assume !~bvslt32(~i~0, 10bv32); {549#false} is VALID [2018-11-23 10:25:09,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:09,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:09,244 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {549#false} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:25:09,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:25:09,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {549#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {549#false} is VALID [2018-11-23 10:25:09,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:25:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:25:09,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:09,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:25:09,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {549#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {549#false} is VALID [2018-11-23 10:25:09,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:25:09,412 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {548#true} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:25:09,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:09,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:09,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {548#true} assume !~bvslt32(~i~0, 10bv32); {548#true} is VALID [2018-11-23 10:25:09,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:25:09,413 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:09,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:25:09,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 9bv32); {549#false} is VALID [2018-11-23 10:25:09,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {549#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {549#false} is VALID [2018-11-23 10:25:09,415 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {548#true} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:25:09,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:09,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:09,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {548#true} assume !~bvslt32(~i~0, 10bv32); {548#true} is VALID [2018-11-23 10:25:09,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:25:09,416 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:09,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {549#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:25:09,417 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {548#true} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:25:09,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:09,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:09,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {548#true} assume !~bvslt32(~i~0, 10bv32); {548#true} is VALID [2018-11-23 10:25:09,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:25:09,418 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:09,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#(bvslt main_~i~1 (_ bv10 32))} assume !~bvslt32(~i~1, 10bv32); {549#false} is VALID [2018-11-23 10:25:09,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {729#(bvslt main_~i~1 (_ bv10 32))} is VALID [2018-11-23 10:25:09,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:09,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {548#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:09,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:25:09,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:25:09,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:09,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {548#true} is VALID [2018-11-23 10:25:09,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:25:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:25:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:09,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:09,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:25:09,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:09,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:09,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:09,563 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-23 10:25:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,939 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 10:25:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:09,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:25:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:25:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:25:09,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 10:25:10,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:10,072 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:25:10,073 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:25:10,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:25:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:25:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 10:25:10,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:10,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:10,096 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:10,096 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:10,099 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:25:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:10,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:10,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:10,101 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:10,101 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:10,104 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:25:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:10,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:10,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:10,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:10,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:25:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 10:25:10,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 34 [2018-11-23 10:25:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:10,109 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 10:25:10,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:25:10,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:10,111 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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:10,111 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:10,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -821989805, now seen corresponding path program 2 times [2018-11-23 10:25:10,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:10,112 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:10,134 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:10,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:25:10,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:10,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:10,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {945#true} is VALID [2018-11-23 10:25:10,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {945#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {945#true} is VALID [2018-11-23 10:25:10,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:10,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #66#return; {945#true} is VALID [2018-11-23 10:25:10,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret12 := main(); {945#true} is VALID [2018-11-23 10:25:10,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {945#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {945#true} is VALID [2018-11-23 10:25:10,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:25:10,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:25:10,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {945#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:25:10,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:25:10,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {945#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:25:10,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:25:10,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {945#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:25:10,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:25:10,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {945#true} assume !~bvslt32(~i~1, 10bv32); {945#true} is VALID [2018-11-23 10:25:10,276 INFO L256 TraceCheckUtils]: 15: Hoare triple {945#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:10,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {945#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; {945#true} is VALID [2018-11-23 10:25:10,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {945#true} assume !~bvslt32(~i~0, 10bv32); {945#true} is VALID [2018-11-23 10:25:10,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#true} #res := ~ret~0[32:0]; {945#true} is VALID [2018-11-23 10:25:10,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:10,278 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {945#true} {945#true} #70#return; {945#true} is VALID [2018-11-23 10:25:10,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {945#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {945#true} is VALID [2018-11-23 10:25:10,279 INFO L256 TraceCheckUtils]: 22: Hoare triple {945#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:10,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {945#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; {945#true} is VALID [2018-11-23 10:25:10,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {945#true} assume !~bvslt32(~i~0, 10bv32); {945#true} is VALID [2018-11-23 10:25:10,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {945#true} #res := ~ret~0[32:0]; {945#true} is VALID [2018-11-23 10:25:10,279 INFO L273 TraceCheckUtils]: 26: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:10,280 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {945#true} {945#true} #72#return; {945#true} is VALID [2018-11-23 10:25:10,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {945#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {945#true} is VALID [2018-11-23 10:25:10,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {945#true} assume !~bvslt32(~i~2, 9bv32); {945#true} is VALID [2018-11-23 10:25:10,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {945#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {945#true} is VALID [2018-11-23 10:25:10,281 INFO L256 TraceCheckUtils]: 31: Hoare triple {945#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:10,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {945#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; {1046#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:10,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {1046#(= sum_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {946#false} is VALID [2018-11-23 10:25:10,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {946#false} #res := ~ret~0[32:0]; {946#false} is VALID [2018-11-23 10:25:10,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {946#false} assume true; {946#false} is VALID [2018-11-23 10:25:10,282 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {946#false} {945#true} #74#return; {946#false} is VALID [2018-11-23 10:25:10,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {946#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {946#false} is VALID [2018-11-23 10:25:10,283 INFO L273 TraceCheckUtils]: 38: Hoare triple {946#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {946#false} is VALID [2018-11-23 10:25:10,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {946#false} assume !false; {946#false} is VALID [2018-11-23 10:25:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 10:25:10,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:10,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:10,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:10,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:25:10,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:10,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:10,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:10,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:10,341 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-23 10:25:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:10,482 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 10:25:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:10,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:25:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:25:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:25:10,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 10:25:10,586 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:10,588 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:25:10,588 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:25:10,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:25:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 10:25:10,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:10,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:10,601 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:10,601 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:10,605 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:25:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:25:10,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:10,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:10,606 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 10:25:10,606 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 10:25:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:10,609 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:25:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:25:10,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:10,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:10,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:10,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:25:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 10:25:10,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 40 [2018-11-23 10:25:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:10,614 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 10:25:10,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 10:25:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:25:10,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:10,616 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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:10,616 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:10,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -830087119, now seen corresponding path program 1 times [2018-11-23 10:25:10,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:10,617 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:10,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:10,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:10,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:25:10,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1260#true} is VALID [2018-11-23 10:25:10,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:25:10,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:25:10,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1280#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:25:10,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {1280#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1280#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:25:10,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1308#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:10,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {1308#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10bv32); {1261#false} is VALID [2018-11-23 10:25:10,926 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:25:10,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 10bv32);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; {1261#false} is VALID [2018-11-23 10:25:10,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:25:10,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1261#false} assume !~bvslt32(~i~0, 10bv32); {1261#false} is VALID [2018-11-23 10:25:10,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,928 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1261#false} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:25:10,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {1261#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:25:10,929 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:25:10,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 10bv32);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; {1261#false} is VALID [2018-11-23 10:25:10,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:25:10,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {1261#false} assume !~bvslt32(~i~0, 10bv32); {1261#false} is VALID [2018-11-23 10:25:10,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,931 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1261#false} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:25:10,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {1261#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1261#false} is VALID [2018-11-23 10:25:10,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 9bv32); {1261#false} is VALID [2018-11-23 10:25:10,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {1261#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:25:10,932 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:25:10,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 10bv32);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; {1261#false} is VALID [2018-11-23 10:25:10,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:25:10,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {1261#false} assume !~bvslt32(~i~0, 10bv32); {1261#false} is VALID [2018-11-23 10:25:10,933 INFO L273 TraceCheckUtils]: 40: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,933 INFO L273 TraceCheckUtils]: 41: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,934 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1261#false} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:25:10,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:25:10,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {1261#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1261#false} is VALID [2018-11-23 10:25:10,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:25:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 10:25:10,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:11,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:25:11,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {1261#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1261#false} is VALID [2018-11-23 10:25:11,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:25:11,239 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1260#true} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:25:11,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:11,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:11,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {1260#true} assume !~bvslt32(~i~0, 10bv32); {1260#true} is VALID [2018-11-23 10:25:11,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:25:11,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 10bv32);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; {1260#true} is VALID [2018-11-23 10:25:11,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:25:11,241 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:11,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {1261#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:25:11,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 9bv32); {1261#false} is VALID [2018-11-23 10:25:11,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {1261#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1261#false} is VALID [2018-11-23 10:25:11,242 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1260#true} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:25:11,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:11,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:11,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {1260#true} assume !~bvslt32(~i~0, 10bv32); {1260#true} is VALID [2018-11-23 10:25:11,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:25:11,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 10bv32);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; {1260#true} is VALID [2018-11-23 10:25:11,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:25:11,244 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:11,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {1261#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:25:11,244 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1260#true} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:25:11,245 INFO L273 TraceCheckUtils]: 21: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:11,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:11,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {1260#true} assume !~bvslt32(~i~0, 10bv32); {1260#true} is VALID [2018-11-23 10:25:11,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:25:11,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 10bv32);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; {1260#true} is VALID [2018-11-23 10:25:11,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:25:11,246 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:11,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#(bvslt main_~i~1 (_ bv10 32))} assume !~bvslt32(~i~1, 10bv32); {1261#false} is VALID [2018-11-23 10:25:11,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1498#(bvslt main_~i~1 (_ bv10 32))} is VALID [2018-11-23 10:25:11,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:11,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:25:11,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:25:11,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:11,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1260#true} is VALID [2018-11-23 10:25:11,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:25:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 10:25:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:25:11,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:25:11,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:11,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:25:11,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:11,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:25:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:25:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:25:11,397 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-23 10:25:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,344 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2018-11-23 10:25:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:25:12,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:25:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:25:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:25:12,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 10:25:12,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:12,582 INFO L225 Difference]: With dead ends: 65 [2018-11-23 10:25:12,582 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 10:25:12,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:25:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 10:25:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 10:25:12,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:12,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 10:25:12,634 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 10:25:12,635 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 10:25:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,638 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:25:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:25:12,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:12,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:12,640 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 10:25:12,640 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 10:25:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,643 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:25:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:25:12,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:12,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:12,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:12,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:25:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 10:25:12,647 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 46 [2018-11-23 10:25:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:12,647 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 10:25:12,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:25:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:25:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 10:25:12,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:12,650 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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:12,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:12,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1061503491, now seen corresponding path program 2 times [2018-11-23 10:25:12,651 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:12,651 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:12,683 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:12,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:12,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:12,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:12,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 10:25:12,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1809#true} is VALID [2018-11-23 10:25:12,908 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 10:25:12,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 10:25:12,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 10:25:12,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1809#true} is VALID [2018-11-23 10:25:12,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:12,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:12,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {1809#true} assume !~bvslt32(~i~1, 10bv32); {1809#true} is VALID [2018-11-23 10:25:12,914 INFO L256 TraceCheckUtils]: 27: Hoare triple {1809#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 10:25:12,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#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; {1898#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:12,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {1898#(= sum_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32);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; {1898#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:12,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {1898#(= sum_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1905#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:12,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {1905#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {1810#false} is VALID [2018-11-23 10:25:12,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} #res := ~ret~0[32:0]; {1810#false} is VALID [2018-11-23 10:25:12,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 10:25:12,920 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1810#false} {1809#true} #70#return; {1810#false} is VALID [2018-11-23 10:25:12,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {1810#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1810#false} is VALID [2018-11-23 10:25:12,921 INFO L256 TraceCheckUtils]: 36: Hoare triple {1810#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 10:25:12,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#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; {1810#false} is VALID [2018-11-23 10:25:12,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} assume !!~bvslt32(~i~0, 10bv32);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; {1810#false} is VALID [2018-11-23 10:25:12,921 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1810#false} is VALID [2018-11-23 10:25:12,922 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} assume !~bvslt32(~i~0, 10bv32); {1810#false} is VALID [2018-11-23 10:25:12,922 INFO L273 TraceCheckUtils]: 41: Hoare triple {1810#false} #res := ~ret~0[32:0]; {1810#false} is VALID [2018-11-23 10:25:12,922 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 10:25:12,922 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 10:25:12,922 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1810#false} is VALID [2018-11-23 10:25:12,923 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !~bvslt32(~i~2, 9bv32); {1810#false} is VALID [2018-11-23 10:25:12,923 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {1810#false} is VALID [2018-11-23 10:25:12,923 INFO L256 TraceCheckUtils]: 47: Hoare triple {1810#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 10:25:12,923 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#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; {1810#false} is VALID [2018-11-23 10:25:12,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume !!~bvslt32(~i~0, 10bv32);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; {1810#false} is VALID [2018-11-23 10:25:12,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1810#false} is VALID [2018-11-23 10:25:12,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume !~bvslt32(~i~0, 10bv32); {1810#false} is VALID [2018-11-23 10:25:12,924 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} #res := ~ret~0[32:0]; {1810#false} is VALID [2018-11-23 10:25:12,924 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 10:25:12,925 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 10:25:12,925 INFO L273 TraceCheckUtils]: 55: Hoare triple {1810#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 10:25:12,925 INFO L273 TraceCheckUtils]: 56: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 10:25:12,925 INFO L273 TraceCheckUtils]: 57: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 10:25:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-23 10:25:12,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:13,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 10:25:13,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 10:25:13,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {1810#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 10:25:13,071 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 10:25:13,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 10:25:13,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {1809#true} #res := ~ret~0[32:0]; {1809#true} is VALID [2018-11-23 10:25:13,072 INFO L273 TraceCheckUtils]: 51: Hoare triple {1809#true} assume !~bvslt32(~i~0, 10bv32); {1809#true} is VALID [2018-11-23 10:25:13,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1809#true} is VALID [2018-11-23 10:25:13,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume !!~bvslt32(~i~0, 10bv32);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; {1809#true} is VALID [2018-11-23 10:25:13,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#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; {1809#true} is VALID [2018-11-23 10:25:13,073 INFO L256 TraceCheckUtils]: 47: Hoare triple {1810#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 10:25:13,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {1810#false} is VALID [2018-11-23 10:25:13,073 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !~bvslt32(~i~2, 9bv32); {1810#false} is VALID [2018-11-23 10:25:13,073 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1810#false} is VALID [2018-11-23 10:25:13,074 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 10:25:13,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 10:25:13,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {1809#true} #res := ~ret~0[32:0]; {1809#true} is VALID [2018-11-23 10:25:13,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {1809#true} assume !~bvslt32(~i~0, 10bv32); {1809#true} is VALID [2018-11-23 10:25:13,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1809#true} is VALID [2018-11-23 10:25:13,075 INFO L273 TraceCheckUtils]: 38: Hoare triple {1809#true} assume !!~bvslt32(~i~0, 10bv32);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; {1809#true} is VALID [2018-11-23 10:25:13,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {1809#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; {1809#true} is VALID [2018-11-23 10:25:13,075 INFO L256 TraceCheckUtils]: 36: Hoare triple {1810#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 10:25:13,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {1810#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1810#false} is VALID [2018-11-23 10:25:13,075 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1810#false} {1809#true} #70#return; {1810#false} is VALID [2018-11-23 10:25:13,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 10:25:13,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} #res := ~ret~0[32:0]; {1810#false} is VALID [2018-11-23 10:25:13,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {2068#(bvslt sum_~i~0 (_ bv10 32))} assume !~bvslt32(~i~0, 10bv32); {1810#false} is VALID [2018-11-23 10:25:13,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {2072#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2068#(bvslt sum_~i~0 (_ bv10 32))} is VALID [2018-11-23 10:25:13,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {2072#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32);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; {2072#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:13,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#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; {2072#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:13,078 INFO L256 TraceCheckUtils]: 27: Hoare triple {1809#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 10:25:13,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {1809#true} assume !~bvslt32(~i~1, 10bv32); {1809#true} is VALID [2018-11-23 10:25:13,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1809#true} is VALID [2018-11-23 10:25:13,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {1809#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 10:25:13,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1809#true} is VALID [2018-11-23 10:25:13,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 10:25:13,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 10:25:13,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 10:25:13,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1809#true} is VALID [2018-11-23 10:25:13,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 10:25:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-11-23 10:25:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:13,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:13,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-23 10:25:13,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:13,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:13,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:13,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:13,225 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-23 10:25:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,573 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 10:25:13,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:13,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-23 10:25:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:25:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:25:13,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 10:25:13,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:13,715 INFO L225 Difference]: With dead ends: 70 [2018-11-23 10:25:13,715 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 10:25:13,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:25:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 10:25:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 10:25:13,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:13,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 10:25:13,743 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 10:25:13,743 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 10:25:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,747 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 10:25:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 10:25:13,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:13,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:13,748 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 10:25:13,748 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 10:25:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,751 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 10:25:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 10:25:13,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:13,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:13,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:13,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 10:25:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 10:25:13,755 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 58 [2018-11-23 10:25:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:13,755 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 10:25:13,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 10:25:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 10:25:13,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:13,757 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 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:13,757 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 266830231, now seen corresponding path program 3 times [2018-11-23 10:25:13,758 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:13,779 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:25:13,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:25:13,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:13,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:14,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {2446#true} call ULTIMATE.init(); {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {2446#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2446#true} {2446#true} #66#return; {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {2446#true} call #t~ret12 := main(); {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {2446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {2446#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2446#true} is VALID [2018-11-23 10:25:14,039 INFO L273 TraceCheckUtils]: 25: Hoare triple {2446#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2446#true} is VALID [2018-11-23 10:25:14,039 INFO L273 TraceCheckUtils]: 26: Hoare triple {2446#true} assume !~bvslt32(~i~1, 10bv32); {2446#true} is VALID [2018-11-23 10:25:14,039 INFO L256 TraceCheckUtils]: 27: Hoare triple {2446#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2446#true} is VALID [2018-11-23 10:25:14,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {2446#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; {2446#true} is VALID [2018-11-23 10:25:14,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,041 INFO L273 TraceCheckUtils]: 37: Hoare triple {2446#true} assume !~bvslt32(~i~0, 10bv32); {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {2446#true} #res := ~ret~0[32:0]; {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2446#true} {2446#true} #70#return; {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {2446#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L256 TraceCheckUtils]: 42: Hoare triple {2446#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2446#true} is VALID [2018-11-23 10:25:14,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {2446#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; {2446#true} is VALID [2018-11-23 10:25:14,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 49: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {2446#true} assume !!~bvslt32(~i~0, 10bv32);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; {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {2446#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {2446#true} assume !~bvslt32(~i~0, 10bv32); {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {2446#true} #res := ~ret~0[32:0]; {2446#true} is VALID [2018-11-23 10:25:14,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {2446#true} assume true; {2446#true} is VALID [2018-11-23 10:25:14,045 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2446#true} {2446#true} #72#return; {2446#true} is VALID [2018-11-23 10:25:14,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {2446#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2619#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:25:14,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {2619#(= main_~i~2 (_ bv0 32))} assume !~bvslt32(~i~2, 9bv32); {2447#false} is VALID [2018-11-23 10:25:14,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {2447#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L256 TraceCheckUtils]: 59: Hoare triple {2447#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 60: Hoare triple {2447#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; {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {2447#false} assume !!~bvslt32(~i~0, 10bv32);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; {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {2447#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {2447#false} assume !!~bvslt32(~i~0, 10bv32);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; {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {2447#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2447#false} is VALID [2018-11-23 10:25:14,049 INFO L273 TraceCheckUtils]: 65: Hoare triple {2447#false} assume !!~bvslt32(~i~0, 10bv32);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; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 66: Hoare triple {2447#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 67: Hoare triple {2447#false} assume !!~bvslt32(~i~0, 10bv32);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; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 68: Hoare triple {2447#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 69: Hoare triple {2447#false} assume !~bvslt32(~i~0, 10bv32); {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 70: Hoare triple {2447#false} #res := ~ret~0[32:0]; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {2447#false} assume true; {2447#false} is VALID [2018-11-23 10:25:14,050 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2447#false} {2447#false} #74#return; {2447#false} is VALID [2018-11-23 10:25:14,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {2447#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2447#false} is VALID [2018-11-23 10:25:14,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {2447#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2447#false} is VALID [2018-11-23 10:25:14,051 INFO L273 TraceCheckUtils]: 75: Hoare triple {2447#false} assume !false; {2447#false} is VALID [2018-11-23 10:25:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-23 10:25:14,054 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:14,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:14,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-11-23 10:25:14,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:14,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:14,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:14,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:14,136 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 3 states. [2018-11-23 10:25:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:14,251 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-23 10:25:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:14,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-11-23 10:25:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:25:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:25:14,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 10:25:14,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:14,329 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:25:14,329 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:25:14,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:25:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 10:25:14,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:14,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 10:25:14,372 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 10:25:14,372 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 10:25:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:14,374 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 10:25:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 10:25:14,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:14,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:14,375 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 10:25:14,375 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 10:25:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:14,378 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 10:25:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 10:25:14,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:14,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:14,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:14,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 10:25:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 10:25:14,381 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 76 [2018-11-23 10:25:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:14,381 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 10:25:14,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 10:25:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 10:25:14,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:14,383 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 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:14,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:14,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1586165269, now seen corresponding path program 1 times [2018-11-23 10:25:14,384 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:14,384 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:14,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:14,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:14,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {2969#true} call ULTIMATE.init(); {2969#true} is VALID [2018-11-23 10:25:14,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {2969#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2969#true} is VALID [2018-11-23 10:25:14,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {2969#true} assume true; {2969#true} is VALID [2018-11-23 10:25:14,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2969#true} {2969#true} #66#return; {2969#true} is VALID [2018-11-23 10:25:14,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {2969#true} call #t~ret12 := main(); {2969#true} is VALID [2018-11-23 10:25:14,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {2969#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2969#true} is VALID [2018-11-23 10:25:14,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:14,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:14,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {2969#true} assume !~bvslt32(~i~1, 10bv32); {2969#true} is VALID [2018-11-23 10:25:14,888 INFO L256 TraceCheckUtils]: 27: Hoare triple {2969#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2969#true} is VALID [2018-11-23 10:25:14,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {2969#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; {3058#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:14,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {3058#(= sum_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3058#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:14,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {3058#(= sum_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3065#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:14,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {3065#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3065#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:14,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3072#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:14,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {3072#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3072#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:14,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {3072#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3079#(= (_ bv3 32) sum_~i~0)} is VALID [2018-11-23 10:25:14,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {3079#(= (_ bv3 32) sum_~i~0)} assume !!~bvslt32(~i~0, 10bv32);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; {3079#(= (_ bv3 32) sum_~i~0)} is VALID [2018-11-23 10:25:14,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {3079#(= (_ bv3 32) sum_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3086#(= (bvadd sum_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:14,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {3086#(= (bvadd sum_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10bv32); {2970#false} is VALID [2018-11-23 10:25:14,892 INFO L273 TraceCheckUtils]: 38: Hoare triple {2970#false} #res := ~ret~0[32:0]; {2970#false} is VALID [2018-11-23 10:25:14,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {2970#false} assume true; {2970#false} is VALID [2018-11-23 10:25:14,892 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2970#false} {2969#true} #70#return; {2970#false} is VALID [2018-11-23 10:25:14,893 INFO L273 TraceCheckUtils]: 41: Hoare triple {2970#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2970#false} is VALID [2018-11-23 10:25:14,893 INFO L256 TraceCheckUtils]: 42: Hoare triple {2970#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2970#false} is VALID [2018-11-23 10:25:14,893 INFO L273 TraceCheckUtils]: 43: Hoare triple {2970#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; {2970#false} is VALID [2018-11-23 10:25:14,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,894 INFO L273 TraceCheckUtils]: 48: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,894 INFO L273 TraceCheckUtils]: 49: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,895 INFO L273 TraceCheckUtils]: 50: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,895 INFO L273 TraceCheckUtils]: 51: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {2970#false} assume !~bvslt32(~i~0, 10bv32); {2970#false} is VALID [2018-11-23 10:25:14,895 INFO L273 TraceCheckUtils]: 53: Hoare triple {2970#false} #res := ~ret~0[32:0]; {2970#false} is VALID [2018-11-23 10:25:14,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {2970#false} assume true; {2970#false} is VALID [2018-11-23 10:25:14,896 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2970#false} {2970#false} #72#return; {2970#false} is VALID [2018-11-23 10:25:14,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {2970#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2970#false} is VALID [2018-11-23 10:25:14,897 INFO L273 TraceCheckUtils]: 57: Hoare triple {2970#false} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {2970#false} is VALID [2018-11-23 10:25:14,897 INFO L273 TraceCheckUtils]: 58: Hoare triple {2970#false} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2970#false} is VALID [2018-11-23 10:25:14,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {2970#false} assume !~bvslt32(~i~2, 9bv32); {2970#false} is VALID [2018-11-23 10:25:14,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {2970#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {2970#false} is VALID [2018-11-23 10:25:14,898 INFO L256 TraceCheckUtils]: 61: Hoare triple {2970#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2970#false} is VALID [2018-11-23 10:25:14,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {2970#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; {2970#false} is VALID [2018-11-23 10:25:14,898 INFO L273 TraceCheckUtils]: 63: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,899 INFO L273 TraceCheckUtils]: 66: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,899 INFO L273 TraceCheckUtils]: 67: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,900 INFO L273 TraceCheckUtils]: 68: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,900 INFO L273 TraceCheckUtils]: 69: Hoare triple {2970#false} assume !!~bvslt32(~i~0, 10bv32);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; {2970#false} is VALID [2018-11-23 10:25:14,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {2970#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2970#false} is VALID [2018-11-23 10:25:14,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {2970#false} assume !~bvslt32(~i~0, 10bv32); {2970#false} is VALID [2018-11-23 10:25:14,901 INFO L273 TraceCheckUtils]: 72: Hoare triple {2970#false} #res := ~ret~0[32:0]; {2970#false} is VALID [2018-11-23 10:25:14,901 INFO L273 TraceCheckUtils]: 73: Hoare triple {2970#false} assume true; {2970#false} is VALID [2018-11-23 10:25:14,901 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2970#false} {2970#false} #74#return; {2970#false} is VALID [2018-11-23 10:25:14,901 INFO L273 TraceCheckUtils]: 75: Hoare triple {2970#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2970#false} is VALID [2018-11-23 10:25:14,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {2970#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2970#false} is VALID [2018-11-23 10:25:14,902 INFO L273 TraceCheckUtils]: 77: Hoare triple {2970#false} assume !false; {2970#false} is VALID [2018-11-23 10:25:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-23 10:25:14,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:15,200 INFO L273 TraceCheckUtils]: 77: Hoare triple {2970#false} assume !false; {2970#false} is VALID [2018-11-23 10:25:15,201 INFO L273 TraceCheckUtils]: 76: Hoare triple {2970#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2970#false} is VALID [2018-11-23 10:25:15,201 INFO L273 TraceCheckUtils]: 75: Hoare triple {2970#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2970#false} is VALID [2018-11-23 10:25:15,201 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2969#true} {2970#false} #74#return; {2970#false} is VALID [2018-11-23 10:25:15,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {2969#true} assume true; {2969#true} is VALID [2018-11-23 10:25:15,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {2969#true} #res := ~ret~0[32:0]; {2969#true} is VALID [2018-11-23 10:25:15,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {2969#true} assume !~bvslt32(~i~0, 10bv32); {2969#true} is VALID [2018-11-23 10:25:15,202 INFO L273 TraceCheckUtils]: 70: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,202 INFO L273 TraceCheckUtils]: 69: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 68: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 67: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 66: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 65: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 64: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 63: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {2969#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; {2969#true} is VALID [2018-11-23 10:25:15,203 INFO L256 TraceCheckUtils]: 61: Hoare triple {2970#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2969#true} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {2970#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {2970#false} assume !~bvslt32(~i~2, 9bv32); {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {2970#false} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 57: Hoare triple {2970#false} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {2970#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2969#true} {2970#false} #72#return; {2970#false} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 54: Hoare triple {2969#true} assume true; {2969#true} is VALID [2018-11-23 10:25:15,204 INFO L273 TraceCheckUtils]: 53: Hoare triple {2969#true} #res := ~ret~0[32:0]; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 52: Hoare triple {2969#true} assume !~bvslt32(~i~0, 10bv32); {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 51: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 50: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 49: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {2969#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2969#true} is VALID [2018-11-23 10:25:15,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {2969#true} assume !!~bvslt32(~i~0, 10bv32);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; {2969#true} is VALID [2018-11-23 10:25:15,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {2969#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; {2969#true} is VALID [2018-11-23 10:25:15,206 INFO L256 TraceCheckUtils]: 42: Hoare triple {2970#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2969#true} is VALID [2018-11-23 10:25:15,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {2970#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2970#false} is VALID [2018-11-23 10:25:15,207 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2970#false} {2969#true} #70#return; {2970#false} is VALID [2018-11-23 10:25:15,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {2970#false} assume true; {2970#false} is VALID [2018-11-23 10:25:15,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {2970#false} #res := ~ret~0[32:0]; {2970#false} is VALID [2018-11-23 10:25:15,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {3333#(bvslt sum_~i~0 (_ bv10 32))} assume !~bvslt32(~i~0, 10bv32); {2970#false} is VALID [2018-11-23 10:25:15,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {3337#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3333#(bvslt sum_~i~0 (_ bv10 32))} is VALID [2018-11-23 10:25:15,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {3337#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3337#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {3344#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv10 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3337#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {3344#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3344#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {3351#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv10 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3344#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,219 INFO L273 TraceCheckUtils]: 31: Hoare triple {3351#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3351#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {3358#(bvslt (bvadd sum_~i~0 (_ bv4 32)) (_ bv10 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3351#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {3358#(bvslt (bvadd sum_~i~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~i~0, 10bv32);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; {3358#(bvslt (bvadd sum_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {2969#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; {3358#(bvslt (bvadd sum_~i~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 10:25:15,224 INFO L256 TraceCheckUtils]: 27: Hoare triple {2969#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2969#true} is VALID [2018-11-23 10:25:15,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {2969#true} assume !~bvslt32(~i~1, 10bv32); {2969#true} is VALID [2018-11-23 10:25:15,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {2969#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2969#true} is VALID [2018-11-23 10:25:15,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2969#true} is VALID [2018-11-23 10:25:15,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {2969#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2969#true} is VALID [2018-11-23 10:25:15,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {2969#true} call #t~ret12 := main(); {2969#true} is VALID [2018-11-23 10:25:15,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2969#true} {2969#true} #66#return; {2969#true} is VALID [2018-11-23 10:25:15,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {2969#true} assume true; {2969#true} is VALID [2018-11-23 10:25:15,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {2969#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2969#true} is VALID [2018-11-23 10:25:15,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {2969#true} call ULTIMATE.init(); {2969#true} is VALID [2018-11-23 10:25:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 10:25:15,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:15,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:25:15,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-23 10:25:15,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:15,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:25:15,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:15,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:25:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:25:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:25:15,348 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 12 states. [2018-11-23 10:25:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,946 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-23 10:25:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:25:16,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-11-23 10:25:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-23 10:25:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2018-11-23 10:25:16,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 77 transitions. [2018-11-23 10:25:17,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:17,078 INFO L225 Difference]: With dead ends: 90 [2018-11-23 10:25:17,078 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 10:25:17,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:25:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 10:25:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 10:25:17,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:17,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-23 10:25:17,100 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 10:25:17,100 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 10:25:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:17,103 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 10:25:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 10:25:17,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:17,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:17,104 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 10:25:17,104 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 10:25:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:17,106 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 10:25:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 10:25:17,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:17,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:17,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:17,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 10:25:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 10:25:17,109 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 78 [2018-11-23 10:25:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:17,109 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 10:25:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:25:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 10:25:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 10:25:17,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:17,111 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 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:17,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:17,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:17,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1708464329, now seen corresponding path program 2 times [2018-11-23 10:25:17,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:17,137 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:17,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:17,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:17,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:17,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2018-11-23 10:25:17,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {3815#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3815#true} is VALID [2018-11-23 10:25:17,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #66#return; {3815#true} is VALID [2018-11-23 10:25:17,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret12 := main(); {3815#true} is VALID [2018-11-23 10:25:17,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {3815#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3815#true} is VALID [2018-11-23 10:25:17,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#true} assume !~bvslt32(~i~1, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L256 TraceCheckUtils]: 27: Hoare triple {3815#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3815#true} is VALID [2018-11-23 10:25:17,574 INFO L273 TraceCheckUtils]: 28: Hoare triple {3815#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; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 37: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 43: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,576 INFO L273 TraceCheckUtils]: 44: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 45: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 46: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 47: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {3815#true} assume !~bvslt32(~i~0, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,577 INFO L273 TraceCheckUtils]: 50: Hoare triple {3815#true} #res := ~ret~0[32:0]; {3815#true} is VALID [2018-11-23 10:25:17,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,578 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3815#true} {3815#true} #70#return; {3815#true} is VALID [2018-11-23 10:25:17,578 INFO L273 TraceCheckUtils]: 53: Hoare triple {3815#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3815#true} is VALID [2018-11-23 10:25:17,578 INFO L256 TraceCheckUtils]: 54: Hoare triple {3815#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3815#true} is VALID [2018-11-23 10:25:17,578 INFO L273 TraceCheckUtils]: 55: Hoare triple {3815#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; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 56: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 57: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 59: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 63: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 64: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 69: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {3815#true} assume !~bvslt32(~i~0, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {3815#true} #res := ~ret~0[32:0]; {3815#true} is VALID [2018-11-23 10:25:17,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,583 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {3815#true} {3815#true} #72#return; {3815#true} is VALID [2018-11-23 10:25:17,599 INFO L273 TraceCheckUtils]: 80: Hoare triple {3815#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4060#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:25:17,600 INFO L273 TraceCheckUtils]: 81: Hoare triple {4060#(= main_~i~2 (_ bv0 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {4060#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:25:17,600 INFO L273 TraceCheckUtils]: 82: Hoare triple {4060#(= main_~i~2 (_ bv0 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4067#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 83: Hoare triple {4067#(= (_ bv1 32) main_~i~2)} assume !~bvslt32(~i~2, 9bv32); {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 84: Hoare triple {3816#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L256 TraceCheckUtils]: 85: Hoare triple {3816#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 86: Hoare triple {3816#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; {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 88: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,603 INFO L273 TraceCheckUtils]: 89: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 90: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 91: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 93: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 94: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 95: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 96: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,604 INFO L273 TraceCheckUtils]: 97: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 98: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 99: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 100: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 101: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 102: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 103: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 104: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,605 INFO L273 TraceCheckUtils]: 105: Hoare triple {3816#false} assume !!~bvslt32(~i~0, 10bv32);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; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 106: Hoare triple {3816#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 107: Hoare triple {3816#false} assume !~bvslt32(~i~0, 10bv32); {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 108: Hoare triple {3816#false} #res := ~ret~0[32:0]; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 109: Hoare triple {3816#false} assume true; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {3816#false} {3816#false} #74#return; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 111: Hoare triple {3816#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 112: Hoare triple {3816#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3816#false} is VALID [2018-11-23 10:25:17,606 INFO L273 TraceCheckUtils]: 113: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2018-11-23 10:25:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 450 proven. 1 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 10:25:17,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:17,755 INFO L273 TraceCheckUtils]: 113: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2018-11-23 10:25:17,756 INFO L273 TraceCheckUtils]: 112: Hoare triple {3816#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3816#false} is VALID [2018-11-23 10:25:17,756 INFO L273 TraceCheckUtils]: 111: Hoare triple {3816#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3816#false} is VALID [2018-11-23 10:25:17,756 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {3815#true} {3816#false} #74#return; {3816#false} is VALID [2018-11-23 10:25:17,757 INFO L273 TraceCheckUtils]: 109: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,757 INFO L273 TraceCheckUtils]: 108: Hoare triple {3815#true} #res := ~ret~0[32:0]; {3815#true} is VALID [2018-11-23 10:25:17,757 INFO L273 TraceCheckUtils]: 107: Hoare triple {3815#true} assume !~bvslt32(~i~0, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,757 INFO L273 TraceCheckUtils]: 106: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 105: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 104: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 103: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 102: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,758 INFO L273 TraceCheckUtils]: 101: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 100: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 99: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 98: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 97: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 96: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,759 INFO L273 TraceCheckUtils]: 95: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 94: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 93: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 92: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 91: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,760 INFO L273 TraceCheckUtils]: 90: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 89: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 88: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {3815#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; {3815#true} is VALID [2018-11-23 10:25:17,762 INFO L256 TraceCheckUtils]: 85: Hoare triple {3816#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3815#true} is VALID [2018-11-23 10:25:17,762 INFO L273 TraceCheckUtils]: 84: Hoare triple {3816#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {3816#false} is VALID [2018-11-23 10:25:17,782 INFO L273 TraceCheckUtils]: 83: Hoare triple {4251#(bvslt main_~i~2 (_ bv9 32))} assume !~bvslt32(~i~2, 9bv32); {3816#false} is VALID [2018-11-23 10:25:17,797 INFO L273 TraceCheckUtils]: 82: Hoare triple {4255#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4251#(bvslt main_~i~2 (_ bv9 32))} is VALID [2018-11-23 10:25:17,805 INFO L273 TraceCheckUtils]: 81: Hoare triple {4255#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {4255#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:17,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {3815#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4255#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:17,808 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {3815#true} {3815#true} #72#return; {3815#true} is VALID [2018-11-23 10:25:17,808 INFO L273 TraceCheckUtils]: 78: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,808 INFO L273 TraceCheckUtils]: 77: Hoare triple {3815#true} #res := ~ret~0[32:0]; {3815#true} is VALID [2018-11-23 10:25:17,808 INFO L273 TraceCheckUtils]: 76: Hoare triple {3815#true} assume !~bvslt32(~i~0, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,808 INFO L273 TraceCheckUtils]: 75: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,808 INFO L273 TraceCheckUtils]: 74: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 71: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 70: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 68: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 65: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 64: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 60: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 59: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 58: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 57: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 56: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,811 INFO L273 TraceCheckUtils]: 55: Hoare triple {3815#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; {3815#true} is VALID [2018-11-23 10:25:17,812 INFO L256 TraceCheckUtils]: 54: Hoare triple {3815#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3815#true} is VALID [2018-11-23 10:25:17,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {3815#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3815#true} is VALID [2018-11-23 10:25:17,812 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3815#true} {3815#true} #70#return; {3815#true} is VALID [2018-11-23 10:25:17,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {3815#true} #res := ~ret~0[32:0]; {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {3815#true} assume !~bvslt32(~i~0, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,813 INFO L273 TraceCheckUtils]: 44: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,815 INFO L273 TraceCheckUtils]: 32: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {3815#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {3815#true} assume !!~bvslt32(~i~0, 10bv32);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; {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {3815#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; {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L256 TraceCheckUtils]: 27: Hoare triple {3815#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3815#true} is VALID [2018-11-23 10:25:17,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {3815#true} assume !~bvslt32(~i~1, 10bv32); {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {3815#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {3815#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {3815#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret12 := main(); {3815#true} is VALID [2018-11-23 10:25:17,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #66#return; {3815#true} is VALID [2018-11-23 10:25:17,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 10:25:17,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {3815#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3815#true} is VALID [2018-11-23 10:25:17,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2018-11-23 10:25:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 10:25:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:17,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-23 10:25:17,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:17,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:17,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:17,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:17,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:17,988 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-23 10:25:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,318 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 10:25:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:18,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-11-23 10:25:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:25:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:25:18,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 10:25:18,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:18,395 INFO L225 Difference]: With dead ends: 102 [2018-11-23 10:25:18,395 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 10:25:18,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:25:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 10:25:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 10:25:18,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:18,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2018-11-23 10:25:18,437 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 10:25:18,437 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 10:25:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,440 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 10:25:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 10:25:18,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:18,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:18,441 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2018-11-23 10:25:18,441 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2018-11-23 10:25:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:18,443 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 10:25:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 10:25:18,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:18,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:18,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:18,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 10:25:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 10:25:18,446 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 114 [2018-11-23 10:25:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:18,447 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 10:25:18,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 10:25:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 10:25:18,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:18,448 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 4, 4, 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,449 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:18,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2122464701, now seen corresponding path program 3 times [2018-11-23 10:25:18,449 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:18,450 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:18,472 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:25:18,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:25:18,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:19,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:19,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {4904#true} call ULTIMATE.init(); {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {4904#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4904#true} {4904#true} #66#return; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {4904#true} call #t~ret12 := main(); {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {4904#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 14: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {4904#true} assume !~bvslt32(~i~1, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L256 TraceCheckUtils]: 27: Hoare triple {4904#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {4904#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; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 33: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 44: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 46: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 48: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {4904#true} assume !~bvslt32(~i~0, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {4904#true} #res := ~ret~0[32:0]; {4904#true} is VALID [2018-11-23 10:25:19,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {4904#true} {4904#true} #70#return; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {4904#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L256 TraceCheckUtils]: 54: Hoare triple {4904#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {4904#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; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 58: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 59: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,175 INFO L273 TraceCheckUtils]: 60: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 62: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 63: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 66: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 67: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,176 INFO L273 TraceCheckUtils]: 68: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 71: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 72: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 73: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 74: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 75: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 76: Hoare triple {4904#true} assume !~bvslt32(~i~0, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,177 INFO L273 TraceCheckUtils]: 77: Hoare triple {4904#true} #res := ~ret~0[32:0]; {4904#true} is VALID [2018-11-23 10:25:19,178 INFO L273 TraceCheckUtils]: 78: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,178 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {4904#true} {4904#true} #72#return; {4904#true} is VALID [2018-11-23 10:25:19,178 INFO L273 TraceCheckUtils]: 80: Hoare triple {4904#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {5149#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:25:19,178 INFO L273 TraceCheckUtils]: 81: Hoare triple {5149#(= main_~i~2 (_ bv0 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5149#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:25:19,179 INFO L273 TraceCheckUtils]: 82: Hoare triple {5149#(= main_~i~2 (_ bv0 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5156#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-23 10:25:19,179 INFO L273 TraceCheckUtils]: 83: Hoare triple {5156#(= (_ bv1 32) main_~i~2)} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5156#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-23 10:25:19,179 INFO L273 TraceCheckUtils]: 84: Hoare triple {5156#(= (_ bv1 32) main_~i~2)} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5163#(= (_ bv2 32) main_~i~2)} is VALID [2018-11-23 10:25:19,180 INFO L273 TraceCheckUtils]: 85: Hoare triple {5163#(= (_ bv2 32) main_~i~2)} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5163#(= (_ bv2 32) main_~i~2)} is VALID [2018-11-23 10:25:19,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {5163#(= (_ bv2 32) main_~i~2)} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5170#(= (_ bv3 32) main_~i~2)} is VALID [2018-11-23 10:25:19,181 INFO L273 TraceCheckUtils]: 87: Hoare triple {5170#(= (_ bv3 32) main_~i~2)} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5170#(= (_ bv3 32) main_~i~2)} is VALID [2018-11-23 10:25:19,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {5170#(= (_ bv3 32) main_~i~2)} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5177#(= (_ bv4 32) main_~i~2)} is VALID [2018-11-23 10:25:19,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {5177#(= (_ bv4 32) main_~i~2)} assume !~bvslt32(~i~2, 9bv32); {4905#false} is VALID [2018-11-23 10:25:19,181 INFO L273 TraceCheckUtils]: 90: Hoare triple {4905#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L256 TraceCheckUtils]: 91: Hoare triple {4905#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L273 TraceCheckUtils]: 92: Hoare triple {4905#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; {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,182 INFO L273 TraceCheckUtils]: 96: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 98: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 100: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 101: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,183 INFO L273 TraceCheckUtils]: 102: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,184 INFO L273 TraceCheckUtils]: 103: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,184 INFO L273 TraceCheckUtils]: 104: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,184 INFO L273 TraceCheckUtils]: 105: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,184 INFO L273 TraceCheckUtils]: 106: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,184 INFO L273 TraceCheckUtils]: 107: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 108: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 109: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 110: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 111: Hoare triple {4905#false} assume !!~bvslt32(~i~0, 10bv32);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; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 112: Hoare triple {4905#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 113: Hoare triple {4905#false} assume !~bvslt32(~i~0, 10bv32); {4905#false} is VALID [2018-11-23 10:25:19,185 INFO L273 TraceCheckUtils]: 114: Hoare triple {4905#false} #res := ~ret~0[32:0]; {4905#false} is VALID [2018-11-23 10:25:19,186 INFO L273 TraceCheckUtils]: 115: Hoare triple {4905#false} assume true; {4905#false} is VALID [2018-11-23 10:25:19,186 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {4905#false} {4905#false} #74#return; {4905#false} is VALID [2018-11-23 10:25:19,186 INFO L273 TraceCheckUtils]: 117: Hoare triple {4905#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4905#false} is VALID [2018-11-23 10:25:19,186 INFO L273 TraceCheckUtils]: 118: Hoare triple {4905#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4905#false} is VALID [2018-11-23 10:25:19,186 INFO L273 TraceCheckUtils]: 119: Hoare triple {4905#false} assume !false; {4905#false} is VALID [2018-11-23 10:25:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 450 proven. 16 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 10:25:19,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 119: Hoare triple {4905#false} assume !false; {4905#false} is VALID [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 118: Hoare triple {4905#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4905#false} is VALID [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 117: Hoare triple {4905#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4905#false} is VALID [2018-11-23 10:25:19,577 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {4904#true} {4905#false} #74#return; {4905#false} is VALID [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 115: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 114: Hoare triple {4904#true} #res := ~ret~0[32:0]; {4904#true} is VALID [2018-11-23 10:25:19,577 INFO L273 TraceCheckUtils]: 113: Hoare triple {4904#true} assume !~bvslt32(~i~0, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 112: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 111: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 110: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 109: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 108: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,578 INFO L273 TraceCheckUtils]: 107: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 106: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 105: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 104: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 102: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 100: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 99: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 98: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 97: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 96: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,580 INFO L273 TraceCheckUtils]: 95: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,581 INFO L273 TraceCheckUtils]: 94: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,581 INFO L273 TraceCheckUtils]: 93: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {4904#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; {4904#true} is VALID [2018-11-23 10:25:19,581 INFO L256 TraceCheckUtils]: 91: Hoare triple {4905#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4904#true} is VALID [2018-11-23 10:25:19,581 INFO L273 TraceCheckUtils]: 90: Hoare triple {4905#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(36bv32, ~#x~0.offset), 4bv32); {4905#false} is VALID [2018-11-23 10:25:19,589 INFO L273 TraceCheckUtils]: 89: Hoare triple {5361#(bvslt main_~i~2 (_ bv9 32))} assume !~bvslt32(~i~2, 9bv32); {4905#false} is VALID [2018-11-23 10:25:19,590 INFO L273 TraceCheckUtils]: 88: Hoare triple {5365#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5361#(bvslt main_~i~2 (_ bv9 32))} is VALID [2018-11-23 10:25:19,591 INFO L273 TraceCheckUtils]: 87: Hoare triple {5365#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5365#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,594 INFO L273 TraceCheckUtils]: 86: Hoare triple {5372#(bvslt (bvadd main_~i~2 (_ bv2 32)) (_ bv9 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5365#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,595 INFO L273 TraceCheckUtils]: 85: Hoare triple {5372#(bvslt (bvadd main_~i~2 (_ bv2 32)) (_ bv9 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5372#(bvslt (bvadd main_~i~2 (_ bv2 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {5379#(bvslt (bvadd main_~i~2 (_ bv3 32)) (_ bv9 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5372#(bvslt (bvadd main_~i~2 (_ bv2 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {5379#(bvslt (bvadd main_~i~2 (_ bv3 32)) (_ bv9 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5379#(bvslt (bvadd main_~i~2 (_ bv3 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,601 INFO L273 TraceCheckUtils]: 82: Hoare triple {5386#(bvslt (bvadd main_~i~2 (_ bv4 32)) (_ bv9 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {5379#(bvslt (bvadd main_~i~2 (_ bv3 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,601 INFO L273 TraceCheckUtils]: 81: Hoare triple {5386#(bvslt (bvadd main_~i~2 (_ bv4 32)) (_ bv9 32))} assume !!~bvslt32(~i~2, 9bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {5386#(bvslt (bvadd main_~i~2 (_ bv4 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,602 INFO L273 TraceCheckUtils]: 80: Hoare triple {4904#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {5386#(bvslt (bvadd main_~i~2 (_ bv4 32)) (_ bv9 32))} is VALID [2018-11-23 10:25:19,602 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {4904#true} {4904#true} #72#return; {4904#true} is VALID [2018-11-23 10:25:19,602 INFO L273 TraceCheckUtils]: 78: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,602 INFO L273 TraceCheckUtils]: 77: Hoare triple {4904#true} #res := ~ret~0[32:0]; {4904#true} is VALID [2018-11-23 10:25:19,602 INFO L273 TraceCheckUtils]: 76: Hoare triple {4904#true} assume !~bvslt32(~i~0, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 75: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 74: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 73: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 72: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 71: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 69: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 66: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 65: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 64: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 63: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 61: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 60: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,604 INFO L273 TraceCheckUtils]: 59: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 58: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {4904#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; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L256 TraceCheckUtils]: 54: Hoare triple {4904#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {4904#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {4904#true} {4904#true} #70#return; {4904#true} is VALID [2018-11-23 10:25:19,605 INFO L273 TraceCheckUtils]: 51: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {4904#true} #res := ~ret~0[32:0]; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {4904#true} assume !~bvslt32(~i~0, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 45: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 37: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 36: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 35: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {4904#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {4904#true} assume !!~bvslt32(~i~0, 10bv32);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; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {4904#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; {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L256 TraceCheckUtils]: 27: Hoare triple {4904#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {4904#true} assume !~bvslt32(~i~1, 10bv32); {4904#true} is VALID [2018-11-23 10:25:19,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {4904#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {4904#true} assume !!~bvslt32(~i~1, 10bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {4904#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {4904#true} call #t~ret12 := main(); {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4904#true} {4904#true} #66#return; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {4904#true} assume true; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {4904#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4904#true} is VALID [2018-11-23 10:25:19,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {4904#true} call ULTIMATE.init(); {4904#true} is VALID [2018-11-23 10:25:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 10:25:19,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:25:19,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2018-11-23 10:25:19,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:19,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:25:19,725 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:19,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:25:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:25:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:25:19,726 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 12 states. [2018-11-23 10:25:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,521 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-11-23 10:25:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 10:25:20,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2018-11-23 10:25:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-23 10:25:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-23 10:25:20,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2018-11-23 10:25:20,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:20,625 INFO L225 Difference]: With dead ends: 112 [2018-11-23 10:25:20,625 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 10:25:20,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:25:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 10:25:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 10:25:20,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:20,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 10:25:20,675 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 10:25:20,675 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 10:25:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,678 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 10:25:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 10:25:20,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,679 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 10:25:20,679 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 10:25:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,681 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 10:25:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 10:25:20,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:20,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 10:25:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 10:25:20,685 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 120 [2018-11-23 10:25:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:20,685 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 10:25:20,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:25:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 10:25:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 10:25:20,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:20,687 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 9, 9, 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,688 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:20,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1422542521, now seen corresponding path program 4 times [2018-11-23 10:25:20,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:20,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:20,717 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST