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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:59:52,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:59:52,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:59:52,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:59:52,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:59:52,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:59:52,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:59:52,396 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:59:52,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:59:52,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:59:52,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:59:52,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:59:52,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:59:52,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:59:52,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:59:52,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:59:52,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:59:52,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:59:52,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:59:52,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:59:52,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:59:52,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:59:52,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:59:52,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:59:52,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:59:52,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:59:52,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:59:52,418 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:59:52,419 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:59:52,420 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:59:52,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:59:52,421 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:59:52,421 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:59:52,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:59:52,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:59:52,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:59:52,424 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:59:52,439 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:59:52,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:59:52,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:59:52,441 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:59:52,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:59:52,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:59:52,443 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:59:52,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:59:52,443 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:59:52,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:59:52,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:59:52,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:59:52,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:59:52,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:59:52,444 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:59:52,444 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:59:52,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:59:52,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:59:52,446 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:59:52,446 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:59:52,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:59:52,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:59:52,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:59:52,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:59:52,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:59:52,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:59:52,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:59:52,447 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:59:52,447 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:59:52,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:59:52,448 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:59:52,449 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:59:52,449 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:59:52,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:59:52,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:59:52,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:59:52,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:59:52,549 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:59:52,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum3_true-unreach-call.i [2018-11-14 17:59:52,624 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723d3809/bfb8d7a66c104442a8054bfc963c0182/FLAG3b607438d [2018-11-14 17:59:53,092 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:59:53,093 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum3_true-unreach-call.i [2018-11-14 17:59:53,100 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723d3809/bfb8d7a66c104442a8054bfc963c0182/FLAG3b607438d [2018-11-14 17:59:53,115 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4723d3809/bfb8d7a66c104442a8054bfc963c0182 [2018-11-14 17:59:53,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:59:53,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:59:53,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:59:53,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:59:53,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:59:53,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e3a03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53, skipping insertion in model container [2018-11-14 17:59:53,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:59:53,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:59:53,423 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:59:53,439 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:59:53,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:59:53,509 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:59:53,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53 WrapperNode [2018-11-14 17:59:53,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:59:53,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:59:53,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:59:53,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:59:53,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (1/1) ... [2018-11-14 17:59:53,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:59:53,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:59:53,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:59:53,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:59:53,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (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-14 17:59:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:59:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:59:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2018-11-14 17:59:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:59:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:59:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:59:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:59:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:59:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:59:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:59:54,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:59:54,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:59:54 BoogieIcfgContainer [2018-11-14 17:59:54,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:59:54,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:59:54,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:59:54,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:59:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:59:53" (1/3) ... [2018-11-14 17:59:54,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27084843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:59:54, skipping insertion in model container [2018-11-14 17:59:54,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:59:53" (2/3) ... [2018-11-14 17:59:54,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27084843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:59:54, skipping insertion in model container [2018-11-14 17:59:54,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:59:54" (3/3) ... [2018-11-14 17:59:54,426 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum3_true-unreach-call.i [2018-11-14 17:59:54,436 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:59:54,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:59:54,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:59:54,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:59:54,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:59:54,501 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:59:54,501 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:59:54,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:59:54,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:59:54,501 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:59:54,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:59:54,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:59:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:59:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:59:54,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:59:54,527 INFO L375 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-14 17:59:54,530 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:59:54,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:59:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:59:54,540 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:59:54,540 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-14 17:59:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:59:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:54,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:59:54,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:59:54,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-14 17:59:54,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:59:54,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:59:54,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret12 := main(); {37#true} is VALID [2018-11-14 17:59:54,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {37#true} is VALID [2018-11-14 17:59:54,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:59:54,954 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:59:54,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#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; {38#false} is VALID [2018-11-14 17:59:54,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:59:54,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:59:54,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:59:54,956 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:59:54,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#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); {38#false} is VALID [2018-11-14 17:59:54,956 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:59:54,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#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; {38#false} is VALID [2018-11-14 17:59:54,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:59:54,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:59:54,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:59:54,958 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:59:54,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#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; {38#false} is VALID [2018-11-14 17:59:54,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:59:54,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {38#false} is VALID [2018-11-14 17:59:54,959 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {38#false} is VALID [2018-11-14 17:59:54,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {38#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; {38#false} is VALID [2018-11-14 17:59:54,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:59:54,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {38#false} #res := ~ret~0[32:0]; {38#false} is VALID [2018-11-14 17:59:54,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:59:54,961 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:59:54,961 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {38#false} is VALID [2018-11-14 17:59:54,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {38#false} is VALID [2018-11-14 17:59:54,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:59:54,969 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-14 17:59:54,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:59:54,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:59:54,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:59:54,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:59:54,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:59:54,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:59:55,127 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-14 17:59:55,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:59:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:59:55,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:59:55,139 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:59:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:55,253 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:59:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:59:55,253 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:59:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:59:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:59:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:59:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:59:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:59:55,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:59:55,612 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-14 17:59:55,624 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:59:55,625 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:59:55,629 INFO L604 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-14 17:59:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:59:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:59:55,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:59:55,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:59:55,806 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:59:55,807 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:59:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:55,813 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:59:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:59:55,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:55,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:55,815 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:59:55,815 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:59:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:55,820 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:59:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:59:55,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:55,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:55,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:59:55,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:59:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:59:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:59:55,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:59:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:59:55,831 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:59:55,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:59:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:59:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:59:55,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:59:55,833 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-14 17:59:55,836 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:59:55,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:59:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:59:55,837 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:59:55,837 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-14 17:59:55,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:59:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:55,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:59:56,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2018-11-14 17:59:56,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {308#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {308#true} is VALID [2018-11-14 17:59:56,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2018-11-14 17:59:56,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #69#return; {308#true} is VALID [2018-11-14 17:59:56,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret12 := main(); {308#true} is VALID [2018-11-14 17:59:56,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {308#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:56,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume true; {328#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:56,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 10000bv32); {309#false} is VALID [2018-11-14 17:59:56,407 INFO L256 TraceCheckUtils]: 8: Hoare triple {309#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:59:56,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {309#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; {309#false} is VALID [2018-11-14 17:59:56,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#false} assume !~bvslt32(~i~0, 10000bv32); {309#false} is VALID [2018-11-14 17:59:56,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:59:56,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,410 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {309#false} {309#false} #73#return; {309#false} is VALID [2018-11-14 17:59:56,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {309#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); {309#false} is VALID [2018-11-14 17:59:56,410 INFO L256 TraceCheckUtils]: 16: Hoare triple {309#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:59:56,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {309#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; {309#false} is VALID [2018-11-14 17:59:56,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {309#false} assume !~bvslt32(~i~0, 10000bv32); {309#false} is VALID [2018-11-14 17:59:56,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:59:56,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,412 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {309#false} {309#false} #75#return; {309#false} is VALID [2018-11-14 17:59:56,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {309#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; {309#false} is VALID [2018-11-14 17:59:56,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {309#false} assume !~bvslt32(~i~2, 9999bv32); {309#false} is VALID [2018-11-14 17:59:56,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {309#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {309#false} is VALID [2018-11-14 17:59:56,414 INFO L256 TraceCheckUtils]: 27: Hoare triple {309#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {309#false} is VALID [2018-11-14 17:59:56,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {309#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; {309#false} is VALID [2018-11-14 17:59:56,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {309#false} assume !~bvslt32(~i~0, 10000bv32); {309#false} is VALID [2018-11-14 17:59:56,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {309#false} #res := ~ret~0[32:0]; {309#false} is VALID [2018-11-14 17:59:56,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {309#false} assume true; {309#false} is VALID [2018-11-14 17:59:56,416 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {309#false} {309#false} #77#return; {309#false} is VALID [2018-11-14 17:59:56,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {309#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {309#false} is VALID [2018-11-14 17:59:56,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {309#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {309#false} is VALID [2018-11-14 17:59:56,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {309#false} assume !false; {309#false} is VALID [2018-11-14 17:59:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:59:56,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:59:56,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:59:56,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:59:56,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:59:56,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:59:56,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:59:56,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:59:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:59:56,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:59:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:59:56,542 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:59:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:56,807 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:59:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:59:56,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:59:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:59:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:59:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:59:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:59:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:59:56,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:59:56,953 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-14 17:59:56,956 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:59:56,957 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:59:56,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:59:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:59:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:59:56,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:59:56,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:59:56,978 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:59:56,979 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:59:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:56,982 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:59:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:59:56,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:56,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:56,984 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:59:56,984 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:59:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:56,988 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:59:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:59:56,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:56,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:56,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:59:56,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:59:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:59:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:59:56,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:59:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:59:56,993 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:59:56,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:59:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:59:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:59:56,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:59:56,995 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:59:56,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:59:56,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:59:56,996 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:59:56,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:59:56,997 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-14 17:59:57,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:59:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:57,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:59:57,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:59:57,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:59:57,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:59:57,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret12 := main(); {598#true} is VALID [2018-11-14 17:59:57,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:57,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume true; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:57,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {618#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {618#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:57,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:57,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:57,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {628#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10000bv32); {599#false} is VALID [2018-11-14 17:59:57,257 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:59:57,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#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; {599#false} is VALID [2018-11-14 17:59:57,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#false} assume !~bvslt32(~i~0, 10000bv32); {599#false} is VALID [2018-11-14 17:59:57,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:59:57,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,259 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {599#false} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:59:57,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#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); {599#false} is VALID [2018-11-14 17:59:57,260 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:59:57,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {599#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; {599#false} is VALID [2018-11-14 17:59:57,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {599#false} assume !~bvslt32(~i~0, 10000bv32); {599#false} is VALID [2018-11-14 17:59:57,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:59:57,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,269 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {599#false} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:59:57,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#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; {599#false} is VALID [2018-11-14 17:59:57,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 9999bv32); {599#false} is VALID [2018-11-14 17:59:57,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:59:57,271 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {599#false} is VALID [2018-11-14 17:59:57,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {599#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; {599#false} is VALID [2018-11-14 17:59:57,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {599#false} assume !~bvslt32(~i~0, 10000bv32); {599#false} is VALID [2018-11-14 17:59:57,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {599#false} #res := ~ret~0[32:0]; {599#false} is VALID [2018-11-14 17:59:57,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,272 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {599#false} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:59:57,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {599#false} is VALID [2018-11-14 17:59:57,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {599#false} is VALID [2018-11-14 17:59:57,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:59:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:59:57,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:59:57,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-14 17:59:57,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {599#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {599#false} is VALID [2018-11-14 17:59:57,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {599#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {599#false} is VALID [2018-11-14 17:59:57,505 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {598#true} {599#false} #77#return; {599#false} is VALID [2018-11-14 17:59:57,505 INFO L273 TraceCheckUtils]: 35: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:59:57,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {598#true} assume !~bvslt32(~i~0, 10000bv32); {598#true} is VALID [2018-11-14 17:59:57,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {598#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; {598#true} is VALID [2018-11-14 17:59:57,508 INFO L256 TraceCheckUtils]: 30: Hoare triple {599#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:59:57,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {599#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {599#false} is VALID [2018-11-14 17:59:57,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {599#false} assume !~bvslt32(~i~2, 9999bv32); {599#false} is VALID [2018-11-14 17:59:57,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {599#false} assume true; {599#false} is VALID [2018-11-14 17:59:57,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {599#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; {599#false} is VALID [2018-11-14 17:59:57,509 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {598#true} {599#false} #75#return; {599#false} is VALID [2018-11-14 17:59:57,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,510 INFO L273 TraceCheckUtils]: 23: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:59:57,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {598#true} assume !~bvslt32(~i~0, 10000bv32); {598#true} is VALID [2018-11-14 17:59:57,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#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; {598#true} is VALID [2018-11-14 17:59:57,511 INFO L256 TraceCheckUtils]: 19: Hoare triple {599#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:59:57,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#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); {599#false} is VALID [2018-11-14 17:59:57,512 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {598#true} {599#false} #73#return; {599#false} is VALID [2018-11-14 17:59:57,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {598#true} #res := ~ret~0[32:0]; {598#true} is VALID [2018-11-14 17:59:57,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {598#true} assume !~bvslt32(~i~0, 10000bv32); {598#true} is VALID [2018-11-14 17:59:57,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#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; {598#true} is VALID [2018-11-14 17:59:57,513 INFO L256 TraceCheckUtils]: 11: Hoare triple {599#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {598#true} is VALID [2018-11-14 17:59:57,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#(bvslt main_~i~1 (_ bv10000 32))} assume !~bvslt32(~i~1, 10000bv32); {599#false} is VALID [2018-11-14 17:59:57,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#(bvslt main_~i~1 (_ bv10000 32))} assume true; {809#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 17:59:57,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {809#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 17:59:57,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:57,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume true; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:57,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {816#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:57,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret12 := main(); {598#true} is VALID [2018-11-14 17:59:57,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #69#return; {598#true} is VALID [2018-11-14 17:59:57,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-14 17:59:57,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {598#true} is VALID [2018-11-14 17:59:57,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-14 17:59:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:59:57,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:59:57,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:59:57,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:59:57,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:59:57,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:59:57,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:59:57,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:59:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:59:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:59:57,663 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-14 17:59:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:57,965 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 17:59:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:59:57,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:59:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:59:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:59:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:59:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:59:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2018-11-14 17:59:57,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2018-11-14 17:59:58,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:59:58,103 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:59:58,104 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:59:58,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:59:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:59:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:59:58,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:59:58,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:59:58,119 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:59:58,120 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:59:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:58,125 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:59:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:59:58,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:58,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:58,126 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:59:58,126 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:59:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:58,129 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:59:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:59:58,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:58,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:58,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:59:58,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:59:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:59:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-14 17:59:58,134 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 40 [2018-11-14 17:59:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:59:58,134 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-14 17:59:58,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:59:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:59:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:59:58,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:59:58,137 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2018-11-14 17:59:58,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:59:58,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:59:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash -384166189, now seen corresponding path program 2 times [2018-11-14 17:59:58,138 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:59:58,138 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-14 17:59:58,159 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:59:58,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:59:58,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:59:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:58,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:59:58,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2018-11-14 17:59:58,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {1061#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1061#true} is VALID [2018-11-14 17:59:58,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} #69#return; {1061#true} is VALID [2018-11-14 17:59:58,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {1061#true} call #t~ret12 := main(); {1061#true} is VALID [2018-11-14 17:59:58,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1061#true} is VALID [2018-11-14 17:59:58,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:59:58,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:59:58,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:59:58,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:59:58,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:59:58,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:59:58,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {1061#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1061#true} is VALID [2018-11-14 17:59:58,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1061#true} is VALID [2018-11-14 17:59:58,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {1061#true} assume !~bvslt32(~i~1, 10000bv32); {1061#true} is VALID [2018-11-14 17:59:58,358 INFO L256 TraceCheckUtils]: 20: Hoare triple {1061#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:59:58,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {1061#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; {1061#true} is VALID [2018-11-14 17:59:58,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {1061#true} assume !~bvslt32(~i~0, 10000bv32); {1061#true} is VALID [2018-11-14 17:59:58,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {1061#true} #res := ~ret~0[32:0]; {1061#true} is VALID [2018-11-14 17:59:58,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,360 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1061#true} {1061#true} #73#return; {1061#true} is VALID [2018-11-14 17:59:58,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {1061#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); {1061#true} is VALID [2018-11-14 17:59:58,360 INFO L256 TraceCheckUtils]: 28: Hoare triple {1061#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:59:58,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {1061#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; {1061#true} is VALID [2018-11-14 17:59:58,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {1061#true} assume !~bvslt32(~i~0, 10000bv32); {1061#true} is VALID [2018-11-14 17:59:58,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {1061#true} #res := ~ret~0[32:0]; {1061#true} is VALID [2018-11-14 17:59:58,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,361 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1061#true} {1061#true} #75#return; {1061#true} is VALID [2018-11-14 17:59:58,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {1061#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; {1061#true} is VALID [2018-11-14 17:59:58,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {1061#true} assume true; {1061#true} is VALID [2018-11-14 17:59:58,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {1061#true} assume !~bvslt32(~i~2, 9999bv32); {1061#true} is VALID [2018-11-14 17:59:58,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {1061#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {1061#true} is VALID [2018-11-14 17:59:58,362 INFO L256 TraceCheckUtils]: 39: Hoare triple {1061#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1061#true} is VALID [2018-11-14 17:59:58,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {1061#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; {1186#(= (_ bv0 32) mapsum_~i~0)} is VALID [2018-11-14 17:59:58,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {1186#(= (_ bv0 32) mapsum_~i~0)} assume true; {1186#(= (_ bv0 32) mapsum_~i~0)} is VALID [2018-11-14 17:59:58,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {1186#(= (_ bv0 32) mapsum_~i~0)} assume !~bvslt32(~i~0, 10000bv32); {1062#false} is VALID [2018-11-14 17:59:58,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {1062#false} #res := ~ret~0[32:0]; {1062#false} is VALID [2018-11-14 17:59:58,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {1062#false} assume true; {1062#false} is VALID [2018-11-14 17:59:58,370 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1062#false} {1061#true} #77#return; {1062#false} is VALID [2018-11-14 17:59:58,371 INFO L273 TraceCheckUtils]: 46: Hoare triple {1062#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1062#false} is VALID [2018-11-14 17:59:58,371 INFO L273 TraceCheckUtils]: 47: Hoare triple {1062#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1062#false} is VALID [2018-11-14 17:59:58,371 INFO L273 TraceCheckUtils]: 48: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2018-11-14 17:59:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-14 17:59:58,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:59:58,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:59:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:59:58,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:59:58,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:59:58,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:59:58,449 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-14 17:59:58,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:59:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:59:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:59:58,450 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2018-11-14 17:59:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:58,633 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 17:59:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:59:58,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:59:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:59:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:59:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:59:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:59:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:59:58,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:59:58,869 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-14 17:59:58,872 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:59:58,872 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:59:58,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-14 17:59:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:59:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-14 17:59:58,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:59:58,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-14 17:59:58,908 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-14 17:59:58,908 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-14 17:59:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:58,910 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:59:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:59:58,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:58,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:58,912 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-14 17:59:58,912 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-14 17:59:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:59:58,915 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-14 17:59:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:59:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:59:58,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:59:58,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:59:58,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:59:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:59:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 17:59:58,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 49 [2018-11-14 17:59:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:59:58,920 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 17:59:58,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:59:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:59:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:59:58,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:59:58,923 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 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, 1] [2018-11-14 17:59:58,923 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:59:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:59:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1791434779, now seen corresponding path program 1 times [2018-11-14 17:59:58,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:59:58,924 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-14 17:59:58,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:59:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:59:59,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:59:59,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:59:59,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:59:59,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:59:59,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret12 := main(); {1437#true} is VALID [2018-11-14 17:59:59,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:59,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume true; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:59,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1457#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:59:59,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {1457#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1467#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {1477#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:59:59,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10000bv32); {1438#false} is VALID [2018-11-14 17:59:59,228 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:59:59,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {1438#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; {1438#false} is VALID [2018-11-14 17:59:59,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:59:59,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:59:59,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {1438#false} assume !~bvslt32(~i~0, 10000bv32); {1438#false} is VALID [2018-11-14 17:59:59,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:59:59,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,232 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1438#false} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:59:59,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#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); {1438#false} is VALID [2018-11-14 17:59:59,232 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:59:59,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {1438#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; {1438#false} is VALID [2018-11-14 17:59:59,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:59:59,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:59:59,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {1438#false} assume !~bvslt32(~i~0, 10000bv32); {1438#false} is VALID [2018-11-14 17:59:59,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:59:59,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,235 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1438#false} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:59:59,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#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; {1438#false} is VALID [2018-11-14 17:59:59,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 9999bv32); {1438#false} is VALID [2018-11-14 17:59:59,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:59:59,236 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1438#false} is VALID [2018-11-14 17:59:59,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {1438#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; {1438#false} is VALID [2018-11-14 17:59:59,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {1438#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1438#false} is VALID [2018-11-14 17:59:59,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {1438#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1438#false} is VALID [2018-11-14 17:59:59,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {1438#false} assume !~bvslt32(~i~0, 10000bv32); {1438#false} is VALID [2018-11-14 17:59:59,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {1438#false} #res := ~ret~0[32:0]; {1438#false} is VALID [2018-11-14 17:59:59,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,237 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1438#false} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:59:59,238 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1438#false} is VALID [2018-11-14 17:59:59,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:59:59,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:59:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:59:59,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:59:59,591 INFO L273 TraceCheckUtils]: 57: Hoare triple {1438#false} assume !false; {1438#false} is VALID [2018-11-14 17:59:59,591 INFO L273 TraceCheckUtils]: 56: Hoare triple {1438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1438#false} is VALID [2018-11-14 17:59:59,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {1438#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1438#false} is VALID [2018-11-14 17:59:59,592 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1437#true} {1438#false} #77#return; {1438#false} is VALID [2018-11-14 17:59:59,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:59:59,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {1437#true} assume !~bvslt32(~i~0, 10000bv32); {1437#true} is VALID [2018-11-14 17:59:59,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,594 INFO L273 TraceCheckUtils]: 49: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:59:59,594 INFO L273 TraceCheckUtils]: 48: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:59:59,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,594 INFO L273 TraceCheckUtils]: 46: Hoare triple {1437#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; {1437#true} is VALID [2018-11-14 17:59:59,595 INFO L256 TraceCheckUtils]: 45: Hoare triple {1438#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:59:59,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {1438#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {1438#false} is VALID [2018-11-14 17:59:59,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {1438#false} assume !~bvslt32(~i~2, 9999bv32); {1438#false} is VALID [2018-11-14 17:59:59,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {1438#false} assume true; {1438#false} is VALID [2018-11-14 17:59:59,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {1438#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; {1438#false} is VALID [2018-11-14 17:59:59,596 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1437#true} {1438#false} #75#return; {1438#false} is VALID [2018-11-14 17:59:59,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,597 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:59:59,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#true} assume !~bvslt32(~i~0, 10000bv32); {1437#true} is VALID [2018-11-14 17:59:59,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,597 INFO L273 TraceCheckUtils]: 35: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:59:59,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:59:59,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {1437#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; {1437#true} is VALID [2018-11-14 17:59:59,599 INFO L256 TraceCheckUtils]: 31: Hoare triple {1438#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:59:59,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {1438#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); {1438#false} is VALID [2018-11-14 17:59:59,599 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1437#true} {1438#false} #73#return; {1438#false} is VALID [2018-11-14 17:59:59,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {1437#true} #res := ~ret~0[32:0]; {1437#true} is VALID [2018-11-14 17:59:59,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {1437#true} assume !~bvslt32(~i~0, 10000bv32); {1437#true} is VALID [2018-11-14 17:59:59,600 INFO L273 TraceCheckUtils]: 25: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {1437#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#true} is VALID [2018-11-14 17:59:59,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {1437#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1437#true} is VALID [2018-11-14 17:59:59,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {1437#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; {1437#true} is VALID [2018-11-14 17:59:59,601 INFO L256 TraceCheckUtils]: 20: Hoare triple {1438#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {1437#true} is VALID [2018-11-14 17:59:59,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(bvslt main_~i~1 (_ bv10000 32))} assume !~bvslt32(~i~1, 10000bv32); {1438#false} is VALID [2018-11-14 17:59:59,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {1732#(bvslt main_~i~1 (_ bv10000 32))} assume true; {1732#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 17:59:59,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1732#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 17:59:59,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume true; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1739#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume true; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1749#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume true; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1759#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume true; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {1437#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1769#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:59:59,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {1437#true} call #t~ret12 := main(); {1437#true} is VALID [2018-11-14 17:59:59,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1437#true} {1437#true} #69#return; {1437#true} is VALID [2018-11-14 17:59:59,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {1437#true} assume true; {1437#true} is VALID [2018-11-14 17:59:59,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {1437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1437#true} is VALID [2018-11-14 17:59:59,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {1437#true} call ULTIMATE.init(); {1437#true} is VALID [2018-11-14 17:59:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:59:59,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:59:59,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:59:59,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 17:59:59,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:59:59,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:59:59,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:59:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:59:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:59:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:59:59,821 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-14 18:00:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:00,775 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-14 18:00:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:00:00,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-14 18:00:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:00:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 18:00:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:00:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2018-11-14 18:00:00,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2018-11-14 18:00:00,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:00:00,984 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:00:00,985 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:00:00,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 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-14 18:00:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:00:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 18:00:01,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:01,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 18:00:01,012 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:00:01,012 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:00:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:01,016 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 18:00:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 18:00:01,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:01,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:01,017 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:00:01,018 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:00:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:01,021 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-14 18:00:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 18:00:01,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:01,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:01,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:01,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:00:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-14 18:00:01,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 58 [2018-11-14 18:00:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:01,026 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-14 18:00:01,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:00:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-14 18:00:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 18:00:01,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:01,027 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 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, 1] [2018-11-14 18:00:01,028 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:01,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1415102757, now seen corresponding path program 2 times [2018-11-14 18:00:01,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:01,029 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-14 18:00:01,046 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:00:01,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:00:01,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:00:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:01,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:01,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 18:00:01,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 18:00:01,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:01,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 18:00:01,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret12 := main(); {2117#true} is VALID [2018-11-14 18:00:01,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:01,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume true; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:01,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2137#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:01,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {2137#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {2157#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {2167#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {2177#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:01,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume true; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:01,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2187#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:01,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {2187#(= (_ bv5 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {2197#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:01,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume true; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:01,496 INFO L273 TraceCheckUtils]: 28: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2207#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:01,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#(= (_ bv7 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {2217#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:01,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume true; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:01,545 INFO L273 TraceCheckUtils]: 34: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2227#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:01,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {2227#(= (_ bv9 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:01,549 INFO L273 TraceCheckUtils]: 37: Hoare triple {2237#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10000bv32); {2118#false} is VALID [2018-11-14 18:00:01,549 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 18:00:01,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#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; {2118#false} is VALID [2018-11-14 18:00:01,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 18:00:01,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 18:00:01,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {2118#false} assume !~bvslt32(~i~0, 10000bv32); {2118#false} is VALID [2018-11-14 18:00:01,551 INFO L273 TraceCheckUtils]: 45: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 18:00:01,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,552 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2118#false} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 18:00:01,552 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#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); {2118#false} is VALID [2018-11-14 18:00:01,553 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 18:00:01,553 INFO L273 TraceCheckUtils]: 50: Hoare triple {2118#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; {2118#false} is VALID [2018-11-14 18:00:01,553 INFO L273 TraceCheckUtils]: 51: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,553 INFO L273 TraceCheckUtils]: 52: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 18:00:01,554 INFO L273 TraceCheckUtils]: 53: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 18:00:01,554 INFO L273 TraceCheckUtils]: 54: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,554 INFO L273 TraceCheckUtils]: 55: Hoare triple {2118#false} assume !~bvslt32(~i~0, 10000bv32); {2118#false} is VALID [2018-11-14 18:00:01,554 INFO L273 TraceCheckUtils]: 56: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 18:00:01,555 INFO L273 TraceCheckUtils]: 57: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,555 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2118#false} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 18:00:01,555 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#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; {2118#false} is VALID [2018-11-14 18:00:01,555 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,556 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 9999bv32); {2118#false} is VALID [2018-11-14 18:00:01,556 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 18:00:01,556 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2118#false} is VALID [2018-11-14 18:00:01,556 INFO L273 TraceCheckUtils]: 64: Hoare triple {2118#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; {2118#false} is VALID [2018-11-14 18:00:01,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {2118#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2118#false} is VALID [2018-11-14 18:00:01,557 INFO L273 TraceCheckUtils]: 67: Hoare triple {2118#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2118#false} is VALID [2018-11-14 18:00:01,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,558 INFO L273 TraceCheckUtils]: 69: Hoare triple {2118#false} assume !~bvslt32(~i~0, 10000bv32); {2118#false} is VALID [2018-11-14 18:00:01,558 INFO L273 TraceCheckUtils]: 70: Hoare triple {2118#false} #res := ~ret~0[32:0]; {2118#false} is VALID [2018-11-14 18:00:01,558 INFO L273 TraceCheckUtils]: 71: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:01,559 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2118#false} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 18:00:01,559 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2118#false} is VALID [2018-11-14 18:00:01,559 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2118#false} is VALID [2018-11-14 18:00:01,559 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 18:00:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 18:00:01,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:02,332 INFO L273 TraceCheckUtils]: 75: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2018-11-14 18:00:02,332 INFO L273 TraceCheckUtils]: 74: Hoare triple {2118#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2118#false} is VALID [2018-11-14 18:00:02,332 INFO L273 TraceCheckUtils]: 73: Hoare triple {2118#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2118#false} is VALID [2018-11-14 18:00:02,333 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {2117#true} {2118#false} #77#return; {2118#false} is VALID [2018-11-14 18:00:02,333 INFO L273 TraceCheckUtils]: 71: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,333 INFO L273 TraceCheckUtils]: 70: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 18:00:02,333 INFO L273 TraceCheckUtils]: 69: Hoare triple {2117#true} assume !~bvslt32(~i~0, 10000bv32); {2117#true} is VALID [2018-11-14 18:00:02,334 INFO L273 TraceCheckUtils]: 68: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,334 INFO L273 TraceCheckUtils]: 67: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 18:00:02,334 INFO L273 TraceCheckUtils]: 66: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 18:00:02,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {2117#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; {2117#true} is VALID [2018-11-14 18:00:02,335 INFO L256 TraceCheckUtils]: 63: Hoare triple {2118#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 18:00:02,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {2118#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {2118#false} is VALID [2018-11-14 18:00:02,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {2118#false} assume !~bvslt32(~i~2, 9999bv32); {2118#false} is VALID [2018-11-14 18:00:02,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {2118#false} assume true; {2118#false} is VALID [2018-11-14 18:00:02,335 INFO L273 TraceCheckUtils]: 59: Hoare triple {2118#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; {2118#false} is VALID [2018-11-14 18:00:02,336 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2117#true} {2118#false} #75#return; {2118#false} is VALID [2018-11-14 18:00:02,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 18:00:02,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {2117#true} assume !~bvslt32(~i~0, 10000bv32); {2117#true} is VALID [2018-11-14 18:00:02,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,336 INFO L273 TraceCheckUtils]: 53: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 18:00:02,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 18:00:02,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {2117#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; {2117#true} is VALID [2018-11-14 18:00:02,337 INFO L256 TraceCheckUtils]: 49: Hoare triple {2118#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 18:00:02,337 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#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); {2118#false} is VALID [2018-11-14 18:00:02,337 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2117#true} {2118#false} #73#return; {2118#false} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 46: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {2117#true} #res := ~ret~0[32:0]; {2117#true} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {2117#true} assume !~bvslt32(~i~0, 10000bv32); {2117#true} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 42: Hoare triple {2117#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2117#true} is VALID [2018-11-14 18:00:02,338 INFO L273 TraceCheckUtils]: 41: Hoare triple {2117#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {2117#true} is VALID [2018-11-14 18:00:02,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {2117#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; {2117#true} is VALID [2018-11-14 18:00:02,339 INFO L256 TraceCheckUtils]: 38: Hoare triple {2118#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {2117#true} is VALID [2018-11-14 18:00:02,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {2472#(bvslt main_~i~1 (_ bv10000 32))} assume !~bvslt32(~i~1, 10000bv32); {2118#false} is VALID [2018-11-14 18:00:02,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {2472#(bvslt main_~i~1 (_ bv10000 32))} assume true; {2472#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 18:00:02,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2472#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 18:00:02,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,341 INFO L273 TraceCheckUtils]: 33: Hoare triple {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume true; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2479#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume true; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,355 INFO L273 TraceCheckUtils]: 29: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2489#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,355 INFO L273 TraceCheckUtils]: 28: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume true; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2499#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume true; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2509#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} assume true; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2519#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} assume true; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2529#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} assume true; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2539#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} assume true; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2549#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} assume true; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2559#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} assume true; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {2117#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2569#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:02,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {2117#true} call #t~ret12 := main(); {2117#true} is VALID [2018-11-14 18:00:02,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2117#true} {2117#true} #69#return; {2117#true} is VALID [2018-11-14 18:00:02,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {2117#true} assume true; {2117#true} is VALID [2018-11-14 18:00:02,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {2117#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2117#true} is VALID [2018-11-14 18:00:02,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {2117#true} call ULTIMATE.init(); {2117#true} is VALID [2018-11-14 18:00:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 18:00:02,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:00:02,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 18:00:02,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 18:00:02,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:02,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:00:02,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:00:02,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:00:02,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:00:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:00:02,638 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 24 states. [2018-11-14 18:00:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,474 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-14 18:00:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:00:06,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-14 18:00:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:00:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 18:00:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:00:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 133 transitions. [2018-11-14 18:00:06,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 133 transitions. [2018-11-14 18:00:06,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:00:06,724 INFO L225 Difference]: With dead ends: 118 [2018-11-14 18:00:06,724 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 18:00:06,726 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:00:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 18:00:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-14 18:00:06,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:06,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-14 18:00:06,771 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 18:00:06,771 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 18:00:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,776 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:00:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:00:06,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:06,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:06,777 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-14 18:00:06,777 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-14 18:00:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,782 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:00:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:00:06,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:06,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:06,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:06,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 18:00:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-14 18:00:06,787 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 76 [2018-11-14 18:00:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:06,787 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-14 18:00:06,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:00:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:00:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 18:00:06,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:06,790 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 6, 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, 1] [2018-11-14 18:00:06,790 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:06,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1699540059, now seen corresponding path program 3 times [2018-11-14 18:00:06,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:06,791 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-14 18:00:06,814 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:00:06,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:00:06,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:00:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:06,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:07,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 18:00:07,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 18:00:07,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 18:00:07,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret12 := main(); {3097#true} is VALID [2018-11-14 18:00:07,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 18:00:07,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,076 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,080 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,081 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,081 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,081 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,081 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,082 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,082 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,082 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,082 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,083 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,083 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,084 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,084 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,084 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,084 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,085 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,085 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,085 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,085 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,085 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 18:00:07,086 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,087 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 18:00:07,087 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#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); {3097#true} is VALID [2018-11-14 18:00:07,087 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,087 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,087 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,088 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 18:00:07,088 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 18:00:07,088 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,088 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,088 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 18:00:07,089 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,089 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 18:00:07,089 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,089 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,089 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 9999bv32); {3097#true} is VALID [2018-11-14 18:00:07,090 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 18:00:07,090 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,103 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#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; {3402#(= (_ bv0 32) mapsum_~i~0)} is VALID [2018-11-14 18:00:07,115 INFO L273 TraceCheckUtils]: 101: Hoare triple {3402#(= (_ bv0 32) mapsum_~i~0)} assume true; {3402#(= (_ bv0 32) mapsum_~i~0)} is VALID [2018-11-14 18:00:07,128 INFO L273 TraceCheckUtils]: 102: Hoare triple {3402#(= (_ bv0 32) mapsum_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3402#(= (_ bv0 32) mapsum_~i~0)} is VALID [2018-11-14 18:00:07,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {3402#(= (_ bv0 32) mapsum_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3412#(= (_ bv1 32) mapsum_~i~0)} is VALID [2018-11-14 18:00:07,155 INFO L273 TraceCheckUtils]: 104: Hoare triple {3412#(= (_ bv1 32) mapsum_~i~0)} assume true; {3412#(= (_ bv1 32) mapsum_~i~0)} is VALID [2018-11-14 18:00:07,156 INFO L273 TraceCheckUtils]: 105: Hoare triple {3412#(= (_ bv1 32) mapsum_~i~0)} assume !~bvslt32(~i~0, 10000bv32); {3098#false} is VALID [2018-11-14 18:00:07,156 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~ret~0[32:0]; {3098#false} is VALID [2018-11-14 18:00:07,156 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 18:00:07,157 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 18:00:07,157 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3098#false} is VALID [2018-11-14 18:00:07,157 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3098#false} is VALID [2018-11-14 18:00:07,157 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 18:00:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 18:00:07,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:07,338 INFO L273 TraceCheckUtils]: 111: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 18:00:07,339 INFO L273 TraceCheckUtils]: 110: Hoare triple {3098#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3098#false} is VALID [2018-11-14 18:00:07,339 INFO L273 TraceCheckUtils]: 109: Hoare triple {3098#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3098#false} is VALID [2018-11-14 18:00:07,339 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {3098#false} {3097#true} #77#return; {3098#false} is VALID [2018-11-14 18:00:07,340 INFO L273 TraceCheckUtils]: 107: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 18:00:07,340 INFO L273 TraceCheckUtils]: 106: Hoare triple {3098#false} #res := ~ret~0[32:0]; {3098#false} is VALID [2018-11-14 18:00:07,340 INFO L273 TraceCheckUtils]: 105: Hoare triple {3458#(bvslt mapsum_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {3098#false} is VALID [2018-11-14 18:00:07,341 INFO L273 TraceCheckUtils]: 104: Hoare triple {3458#(bvslt mapsum_~i~0 (_ bv10000 32))} assume true; {3458#(bvslt mapsum_~i~0 (_ bv10000 32))} is VALID [2018-11-14 18:00:07,345 INFO L273 TraceCheckUtils]: 103: Hoare triple {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3458#(bvslt mapsum_~i~0 (_ bv10000 32))} is VALID [2018-11-14 18:00:07,346 INFO L273 TraceCheckUtils]: 102: Hoare triple {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:07,346 INFO L273 TraceCheckUtils]: 101: Hoare triple {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:07,346 INFO L273 TraceCheckUtils]: 100: Hoare triple {3097#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; {3465#(bvslt (bvadd mapsum_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:07,347 INFO L256 TraceCheckUtils]: 99: Hoare triple {3097#true} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L273 TraceCheckUtils]: 98: Hoare triple {3097#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L273 TraceCheckUtils]: 97: Hoare triple {3097#true} assume !~bvslt32(~i~2, 9999bv32); {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L273 TraceCheckUtils]: 96: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L273 TraceCheckUtils]: 95: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3097#true} {3097#true} #75#return; {3097#true} is VALID [2018-11-14 18:00:07,347 INFO L273 TraceCheckUtils]: 93: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 92: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 91: Hoare triple {3097#true} assume !~bvslt32(~i~0, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 90: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 89: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 88: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 87: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,348 INFO L256 TraceCheckUtils]: 85: Hoare triple {3097#true} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 84: Hoare triple {3097#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); {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {3097#true} {3097#true} #73#return; {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 81: Hoare triple {3097#true} #res := ~ret~0[32:0]; {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 80: Hoare triple {3097#true} assume !~bvslt32(~i~0, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 79: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,349 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {3097#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#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; {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L256 TraceCheckUtils]: 74: Hoare triple {3097#true} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} assume !~bvslt32(~i~1, 10000bv32); {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,350 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,351 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,353 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3097#true} is VALID [2018-11-14 18:00:07,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3097#true} is VALID [2018-11-14 18:00:07,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3097#true} is VALID [2018-11-14 18:00:07,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret12 := main(); {3097#true} is VALID [2018-11-14 18:00:07,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #69#return; {3097#true} is VALID [2018-11-14 18:00:07,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 18:00:07,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 18:00:07,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 18:00:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-11-14 18:00:07,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:00:07,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:00:07,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 18:00:07,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:07,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:00:07,481 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-14 18:00:07,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:00:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:00:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:00:07,482 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-11-14 18:00:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:07,780 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-11-14 18:00:07,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:00:07,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-14 18:00:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:00:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 18:00:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:00:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 18:00:07,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-14 18:00:07,941 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-14 18:00:07,944 INFO L225 Difference]: With dead ends: 126 [2018-11-14 18:00:07,944 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 18:00:07,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 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-14 18:00:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 18:00:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-14 18:00:08,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:08,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-14 18:00:08,014 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 18:00:08,014 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 18:00:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:08,019 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 18:00:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 18:00:08,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:08,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:08,020 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-14 18:00:08,020 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-14 18:00:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:08,024 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-14 18:00:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 18:00:08,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:08,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:08,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:08,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 18:00:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-14 18:00:08,029 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 112 [2018-11-14 18:00:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:08,030 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-14 18:00:08,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:00:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-14 18:00:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-14 18:00:08,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:08,032 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 15, 12, 12, 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] [2018-11-14 18:00:08,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:08,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1458155117, now seen corresponding path program 4 times [2018-11-14 18:00:08,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:08,033 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-14 18:00:08,053 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:00:08,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:00:08,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:00:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:08,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:09,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 18:00:09,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 18:00:09,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:09,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 18:00:09,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret12 := main(); {4297#true} is VALID [2018-11-14 18:00:09,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:09,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume true; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:09,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4317#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 18:00:09,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {4317#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {4327#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {4337#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {4347#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:09,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume true; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:09,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4367#(= (_ bv5 32) main_~i~1)} is VALID [2018-11-14 18:00:09,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {4367#(= (_ bv5 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume true; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {4377#(= (bvadd main_~i~1 (_ bv4294967290 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:09,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume true; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:09,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4387#(= (_ bv7 32) main_~i~1)} is VALID [2018-11-14 18:00:09,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {4387#(= (_ bv7 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume true; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,129 INFO L273 TraceCheckUtils]: 31: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {4397#(= (bvadd main_~i~1 (_ bv4294967288 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:09,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume true; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:09,131 INFO L273 TraceCheckUtils]: 34: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4407#(= (_ bv9 32) main_~i~1)} is VALID [2018-11-14 18:00:09,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {4407#(= (_ bv9 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume true; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {4417#(= (bvadd main_~i~1 (_ bv4294967286 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 18:00:09,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume true; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 18:00:09,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4427#(= (_ bv11 32) main_~i~1)} is VALID [2018-11-14 18:00:09,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {4427#(= (_ bv11 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume true; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {4437#(= (bvadd main_~i~1 (_ bv4294967284 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 18:00:09,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume true; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 18:00:09,138 INFO L273 TraceCheckUtils]: 46: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4447#(= (_ bv13 32) main_~i~1)} is VALID [2018-11-14 18:00:09,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {4447#(= (_ bv13 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume true; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,140 INFO L273 TraceCheckUtils]: 49: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {4457#(= (bvadd main_~i~1 (_ bv4294967282 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 18:00:09,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume true; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 18:00:09,142 INFO L273 TraceCheckUtils]: 52: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4467#(= (_ bv15 32) main_~i~1)} is VALID [2018-11-14 18:00:09,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {4467#(= (_ bv15 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume true; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {4477#(= (bvadd main_~i~1 (_ bv4294967280 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 18:00:09,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume true; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 18:00:09,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4487#(= (_ bv17 32) main_~i~1)} is VALID [2018-11-14 18:00:09,147 INFO L273 TraceCheckUtils]: 59: Hoare triple {4487#(= (_ bv17 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume true; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {4497#(= (bvadd main_~i~1 (_ bv4294967278 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 18:00:09,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume true; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 18:00:09,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4507#(= (_ bv19 32) main_~i~1)} is VALID [2018-11-14 18:00:09,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {4507#(= (_ bv19 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,152 INFO L273 TraceCheckUtils]: 66: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume true; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,152 INFO L273 TraceCheckUtils]: 67: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,153 INFO L273 TraceCheckUtils]: 68: Hoare triple {4517#(= (bvadd main_~i~1 (_ bv4294967276 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 18:00:09,154 INFO L273 TraceCheckUtils]: 69: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume true; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 18:00:09,154 INFO L273 TraceCheckUtils]: 70: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4527#(= (_ bv21 32) main_~i~1)} is VALID [2018-11-14 18:00:09,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {4527#(= (_ bv21 32) main_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume true; {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 18:00:09,156 INFO L273 TraceCheckUtils]: 73: Hoare triple {4537#(= (bvadd main_~i~1 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 10000bv32); {4298#false} is VALID [2018-11-14 18:00:09,156 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 18:00:09,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {4298#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; {4298#false} is VALID [2018-11-14 18:00:09,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,157 INFO L273 TraceCheckUtils]: 78: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,157 INFO L273 TraceCheckUtils]: 79: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,159 INFO L273 TraceCheckUtils]: 89: Hoare triple {4298#false} assume !~bvslt32(~i~0, 10000bv32); {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L273 TraceCheckUtils]: 91: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4298#false} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#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); {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 18:00:09,160 INFO L273 TraceCheckUtils]: 95: Hoare triple {4298#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; {4298#false} is VALID [2018-11-14 18:00:09,161 INFO L273 TraceCheckUtils]: 96: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,161 INFO L273 TraceCheckUtils]: 97: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,161 INFO L273 TraceCheckUtils]: 98: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 101: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 102: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 103: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 104: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 105: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,162 INFO L273 TraceCheckUtils]: 106: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,163 INFO L273 TraceCheckUtils]: 107: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,163 INFO L273 TraceCheckUtils]: 109: Hoare triple {4298#false} assume !~bvslt32(~i~0, 10000bv32); {4298#false} is VALID [2018-11-14 18:00:09,163 INFO L273 TraceCheckUtils]: 110: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 18:00:09,163 INFO L273 TraceCheckUtils]: 111: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4298#false} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#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; {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 9999bv32); {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 18:00:09,164 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4298#false} is VALID [2018-11-14 18:00:09,165 INFO L273 TraceCheckUtils]: 118: Hoare triple {4298#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; {4298#false} is VALID [2018-11-14 18:00:09,165 INFO L273 TraceCheckUtils]: 119: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,165 INFO L273 TraceCheckUtils]: 120: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,165 INFO L273 TraceCheckUtils]: 121: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,165 INFO L273 TraceCheckUtils]: 122: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,166 INFO L273 TraceCheckUtils]: 123: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,166 INFO L273 TraceCheckUtils]: 124: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,166 INFO L273 TraceCheckUtils]: 125: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,166 INFO L273 TraceCheckUtils]: 126: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,166 INFO L273 TraceCheckUtils]: 127: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 128: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 129: Hoare triple {4298#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 130: Hoare triple {4298#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 131: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 132: Hoare triple {4298#false} assume !~bvslt32(~i~0, 10000bv32); {4298#false} is VALID [2018-11-14 18:00:09,167 INFO L273 TraceCheckUtils]: 133: Hoare triple {4298#false} #res := ~ret~0[32:0]; {4298#false} is VALID [2018-11-14 18:00:09,168 INFO L273 TraceCheckUtils]: 134: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:09,168 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4298#false} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 18:00:09,168 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4298#false} is VALID [2018-11-14 18:00:09,168 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4298#false} is VALID [2018-11-14 18:00:09,168 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 18:00:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:00:09,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:11,849 INFO L273 TraceCheckUtils]: 138: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2018-11-14 18:00:11,849 INFO L273 TraceCheckUtils]: 137: Hoare triple {4298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4298#false} is VALID [2018-11-14 18:00:11,849 INFO L273 TraceCheckUtils]: 136: Hoare triple {4298#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4298#false} is VALID [2018-11-14 18:00:11,849 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {4297#true} {4298#false} #77#return; {4298#false} is VALID [2018-11-14 18:00:11,849 INFO L273 TraceCheckUtils]: 134: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,849 INFO L273 TraceCheckUtils]: 133: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 132: Hoare triple {4297#true} assume !~bvslt32(~i~0, 10000bv32); {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 131: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 130: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 129: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 128: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 127: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 126: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,850 INFO L273 TraceCheckUtils]: 125: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 124: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 123: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 122: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 121: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 120: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 119: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L273 TraceCheckUtils]: 118: Hoare triple {4297#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; {4297#true} is VALID [2018-11-14 18:00:11,851 INFO L256 TraceCheckUtils]: 117: Hoare triple {4298#false} call #t~ret11 := mapsum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 116: Hoare triple {4298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(39996bv32, ~#x~0.offset), 4bv32); {4298#false} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 115: Hoare triple {4298#false} assume !~bvslt32(~i~2, 9999bv32); {4298#false} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 114: Hoare triple {4298#false} assume true; {4298#false} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 113: Hoare triple {4298#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; {4298#false} is VALID [2018-11-14 18:00:11,852 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {4297#true} {4298#false} #75#return; {4298#false} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 111: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 110: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 109: Hoare triple {4297#true} assume !~bvslt32(~i~0, 10000bv32); {4297#true} is VALID [2018-11-14 18:00:11,852 INFO L273 TraceCheckUtils]: 108: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 107: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 106: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 105: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 104: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 103: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 102: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,853 INFO L273 TraceCheckUtils]: 100: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 99: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 98: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 97: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 96: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 95: Hoare triple {4297#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; {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L256 TraceCheckUtils]: 94: Hoare triple {4298#false} call #t~ret7 := mapsum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 18:00:11,854 INFO L273 TraceCheckUtils]: 93: Hoare triple {4298#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); {4298#false} is VALID [2018-11-14 18:00:11,854 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {4297#true} {4298#false} #73#return; {4298#false} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 91: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {4297#true} #res := ~ret~0[32:0]; {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {4297#true} assume !~bvslt32(~i~0, 10000bv32); {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 87: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 86: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,855 INFO L273 TraceCheckUtils]: 85: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 84: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 83: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 82: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 81: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 80: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,856 INFO L273 TraceCheckUtils]: 79: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,857 INFO L273 TraceCheckUtils]: 78: Hoare triple {4297#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4297#true} is VALID [2018-11-14 18:00:11,857 INFO L273 TraceCheckUtils]: 77: Hoare triple {4297#true} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {4297#true} is VALID [2018-11-14 18:00:11,857 INFO L273 TraceCheckUtils]: 76: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:11,857 INFO L273 TraceCheckUtils]: 75: Hoare triple {4297#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; {4297#true} is VALID [2018-11-14 18:00:11,857 INFO L256 TraceCheckUtils]: 74: Hoare triple {4298#false} call #t~ret4 := mapsum(~#x~0.base, ~#x~0.offset); {4297#true} is VALID [2018-11-14 18:00:11,872 INFO L273 TraceCheckUtils]: 73: Hoare triple {4934#(bvslt main_~i~1 (_ bv10000 32))} assume !~bvslt32(~i~1, 10000bv32); {4298#false} is VALID [2018-11-14 18:00:11,873 INFO L273 TraceCheckUtils]: 72: Hoare triple {4934#(bvslt main_~i~1 (_ bv10000 32))} assume true; {4934#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 18:00:11,873 INFO L273 TraceCheckUtils]: 71: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4934#(bvslt main_~i~1 (_ bv10000 32))} is VALID [2018-11-14 18:00:11,873 INFO L273 TraceCheckUtils]: 70: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,874 INFO L273 TraceCheckUtils]: 69: Hoare triple {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} assume true; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4941#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,880 INFO L273 TraceCheckUtils]: 66: Hoare triple {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} assume true; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4951#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,886 INFO L273 TraceCheckUtils]: 64: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,886 INFO L273 TraceCheckUtils]: 63: Hoare triple {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} assume true; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,892 INFO L273 TraceCheckUtils]: 62: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4961#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} assume true; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4971#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,899 INFO L273 TraceCheckUtils]: 57: Hoare triple {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} assume true; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,903 INFO L273 TraceCheckUtils]: 56: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4981#(bvslt (bvadd main_~i~1 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,904 INFO L273 TraceCheckUtils]: 55: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} assume true; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4991#(bvslt (bvadd main_~i~1 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,910 INFO L273 TraceCheckUtils]: 51: Hoare triple {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} assume true; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5001#(bvslt (bvadd main_~i~1 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,919 INFO L273 TraceCheckUtils]: 49: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} assume true; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,925 INFO L273 TraceCheckUtils]: 47: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5011#(bvslt (bvadd main_~i~1 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} assume true; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5021#(bvslt (bvadd main_~i~1 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} assume true; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5031#(bvslt (bvadd main_~i~1 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} assume true; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5041#(bvslt (bvadd main_~i~1 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,947 INFO L273 TraceCheckUtils]: 36: Hoare triple {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} assume true; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5051#(bvslt (bvadd main_~i~1 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,952 INFO L273 TraceCheckUtils]: 34: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} assume true; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5061#(bvslt (bvadd main_~i~1 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} assume true; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5071#(bvslt (bvadd main_~i~1 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} assume true; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5081#(bvslt (bvadd main_~i~1 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} assume true; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5091#(bvslt (bvadd main_~i~1 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} assume true; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5101#(bvslt (bvadd main_~i~1 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} assume true; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5111#(bvslt (bvadd main_~i~1 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:11,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} assume true; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5121#(bvslt (bvadd main_~i~1 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} assume true; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5131#(bvslt (bvadd main_~i~1 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} assume true; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5141#(bvslt (bvadd main_~i~1 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} assume !!~bvslt32(~i~1, 10000bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} assume true; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {4297#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40000bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {5151#(bvslt (bvadd main_~i~1 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-14 18:00:12,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {4297#true} call #t~ret12 := main(); {4297#true} is VALID [2018-11-14 18:00:12,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4297#true} {4297#true} #69#return; {4297#true} is VALID [2018-11-14 18:00:12,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {4297#true} assume true; {4297#true} is VALID [2018-11-14 18:00:12,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4297#true} is VALID [2018-11-14 18:00:12,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2018-11-14 18:00:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 18:00:12,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:00:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 18:00:12,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 18:00:12,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:12,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 18:00:12,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:00:12,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 18:00:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 18:00:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 18:00:12,426 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 48 states. [2018-11-14 18:00:17,756 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 18:00:18,288 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 18:00:18,880 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 18:00:19,485 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 18:00:20,101 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 18:00:20,706 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 18:00:21,925 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 18:00:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:29,796 INFO L93 Difference]: Finished difference Result 208 states and 239 transitions. [2018-11-14 18:00:29,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 18:00:29,796 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-11-14 18:00:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:00:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 217 transitions. [2018-11-14 18:00:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:00:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 217 transitions. [2018-11-14 18:00:29,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 217 transitions. [2018-11-14 18:00:30,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:00:30,281 INFO L225 Difference]: With dead ends: 208 [2018-11-14 18:00:30,281 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 18:00:30,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 18:00:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 18:00:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-14 18:00:30,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:30,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 177 states. [2018-11-14 18:00:30,338 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2018-11-14 18:00:30,338 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2018-11-14 18:00:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:30,345 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-11-14 18:00:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 18:00:30,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:30,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:30,346 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 177 states. [2018-11-14 18:00:30,347 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 177 states. [2018-11-14 18:00:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:30,353 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2018-11-14 18:00:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 18:00:30,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:30,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:30,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:30,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-14 18:00:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2018-11-14 18:00:30,360 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 139 [2018-11-14 18:00:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:30,361 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2018-11-14 18:00:30,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 18:00:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2018-11-14 18:00:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 18:00:30,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:30,364 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 15, 12, 12, 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] [2018-11-14 18:00:30,364 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:30,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash 983583891, now seen corresponding path program 5 times [2018-11-14 18:00:30,365 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:30,365 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-14 18:00:30,388 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1