java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:38,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:38,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:38,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:38,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:38,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:38,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:38,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:38,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:38,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:38,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:38,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:38,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:38,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:38,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:38,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:38,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:38,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:38,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:38,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:38,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:38,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:38,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:38,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:38,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:38,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:38,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:38,306 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:38,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:38,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:38,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:38,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:38,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:38,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:38,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:38,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:38,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:26:38,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:38,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:38,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:38,331 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:38,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:38,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:38,332 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:38,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:38,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:38,333 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:38,334 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:38,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:38,334 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:38,334 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:38,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:38,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:38,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:38,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:38,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:38,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:38,336 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:38,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:38,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:38,336 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:38,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:38,336 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:38,337 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:38,337 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:38,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:38,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:38,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:38,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:38,420 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:38,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-23 11:26:38,490 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce842ca6/c47882d258e8428ab66b5b25e1ca9d93/FLAG9c8c15033 [2018-11-23 11:26:38,905 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:38,906 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-23 11:26:38,913 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce842ca6/c47882d258e8428ab66b5b25e1ca9d93/FLAG9c8c15033 [2018-11-23 11:26:39,284 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ce842ca6/c47882d258e8428ab66b5b25e1ca9d93 [2018-11-23 11:26:39,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:39,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:39,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:39,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:39,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:39,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa6eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39, skipping insertion in model container [2018-11-23 11:26:39,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:39,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:39,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:39,641 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:39,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:39,723 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:39,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39 WrapperNode [2018-11-23 11:26:39,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:39,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:39,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:39,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:39,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:39,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:39,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:39,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:39,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... [2018-11-23 11:26:39,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:39,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:39,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:39,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:39,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:39,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:39,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:39,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:26:39,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-23 11:26:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-11-23 11:26:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:39,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:39,940 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 11:26:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:26:40,747 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:40,748 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:26:40,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:40 BoogieIcfgContainer [2018-11-23 11:26:40,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:40,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:40,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:40,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:40,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:39" (1/3) ... [2018-11-23 11:26:40,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff8dba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:40, skipping insertion in model container [2018-11-23 11:26:40,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:39" (2/3) ... [2018-11-23 11:26:40,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff8dba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:40, skipping insertion in model container [2018-11-23 11:26:40,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:40" (3/3) ... [2018-11-23 11:26:40,757 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-11-23 11:26:40,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:40,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:40,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:40,831 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:40,832 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:40,832 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:40,832 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:40,832 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:40,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:40,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:40,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:40,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 11:26:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:26:40,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:40,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:40,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:40,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2138170830, now seen corresponding path program 1 times [2018-11-23 11:26:40,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:40,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:40,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:41,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 11:26:41,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {40#true} is VALID [2018-11-23 11:26:41,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 11:26:41,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #116#return; {40#true} is VALID [2018-11-23 11:26:41,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2018-11-23 11:26:41,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {40#true} is VALID [2018-11-23 11:26:41,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 11:26:41,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {41#false} is VALID [2018-11-23 11:26:41,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {41#false} is VALID [2018-11-23 11:26:41,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 11:26:41,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {41#false} is VALID [2018-11-23 11:26:41,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 11:26:41,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {41#false} is VALID [2018-11-23 11:26:41,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 11:26:41,062 INFO L256 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {41#false} is VALID [2018-11-23 11:26:41,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-23 11:26:41,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0bv32 == ~cond; {41#false} is VALID [2018-11-23 11:26:41,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 11:26:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:41,067 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:41,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:41,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:26:41,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 11:26:41,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:41,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:26:41,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:41,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:26:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:26:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:41,305 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 11:26:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:41,482 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2018-11-23 11:26:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:26:41,483 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 11:26:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 11:26:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 11:26:41,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 95 transitions. [2018-11-23 11:26:41,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:41,866 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:26:41,866 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:26:41,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:26:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 11:26:42,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:42,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 11:26:42,067 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:26:42,067 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:26:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:42,072 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:26:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:26:42,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:42,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:42,074 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 11:26:42,074 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 11:26:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:42,086 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 11:26:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:26:42,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:42,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:42,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:42,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:26:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 11:26:42,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2018-11-23 11:26:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 11:26:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:26:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:26:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:26:42,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:42,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:42,103 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:42,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:42,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1430244045, now seen corresponding path program 1 times [2018-11-23 11:26:42,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:42,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:42,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {282#true} is VALID [2018-11-23 11:26:42,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {282#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {282#true} is VALID [2018-11-23 11:26:42,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2018-11-23 11:26:42,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #116#return; {282#true} is VALID [2018-11-23 11:26:42,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret17 := main(); {282#true} is VALID [2018-11-23 11:26:42,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {282#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {302#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:42,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {302#(= main_~i~0 (_ bv0 32))} assume !~bvult32(~i~0, 5bv32); {283#false} is VALID [2018-11-23 11:26:42,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {283#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {283#false} is VALID [2018-11-23 11:26:42,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {283#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {283#false} is VALID [2018-11-23 11:26:42,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {283#false} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {283#false} is VALID [2018-11-23 11:26:42,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {283#false} is VALID [2018-11-23 11:26:42,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {283#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {283#false} is VALID [2018-11-23 11:26:42,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {283#false} assume !~bvult32(~i~0, ~n_caracter~0); {283#false} is VALID [2018-11-23 11:26:42,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {283#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {283#false} is VALID [2018-11-23 11:26:42,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {283#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {283#false} is VALID [2018-11-23 11:26:42,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {283#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {283#false} is VALID [2018-11-23 11:26:42,497 INFO L256 TraceCheckUtils]: 16: Hoare triple {283#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {283#false} is VALID [2018-11-23 11:26:42,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {283#false} ~cond := #in~cond; {283#false} is VALID [2018-11-23 11:26:42,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {283#false} assume 0bv32 == ~cond; {283#false} is VALID [2018-11-23 11:26:42,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {283#false} assume !false; {283#false} is VALID [2018-11-23 11:26:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:42,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:42,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:42,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:26:42,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 11:26:42,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:42,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:26:42,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:42,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:26:42,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:26:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:42,737 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2018-11-23 11:26:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:43,117 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-23 11:26:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:26:43,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 11:26:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 11:26:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 11:26:43,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 11:26:43,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:43,324 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:26:43,324 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:26:43,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:26:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-23 11:26:43,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:43,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 31 states. [2018-11-23 11:26:43,378 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 31 states. [2018-11-23 11:26:43,378 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 31 states. [2018-11-23 11:26:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:43,382 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 11:26:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2018-11-23 11:26:43,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:43,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:43,383 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 45 states. [2018-11-23 11:26:43,383 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 45 states. [2018-11-23 11:26:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:43,388 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 11:26:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2018-11-23 11:26:43,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:43,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:43,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:43,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:26:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 11:26:43,392 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2018-11-23 11:26:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:43,392 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 11:26:43,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:26:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:26:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:26:43,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:43,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:43,394 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:43,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1498528533, now seen corresponding path program 1 times [2018-11-23 11:26:43,395 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:43,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:43,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:43,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:43,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-23 11:26:43,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {570#true} is VALID [2018-11-23 11:26:43,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-23 11:26:43,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #116#return; {570#true} is VALID [2018-11-23 11:26:43,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret17 := main(); {570#true} is VALID [2018-11-23 11:26:43,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {590#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:43,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(= main_~i~0 (_ bv0 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {590#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:43,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {597#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:43,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {597#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~i~0, 5bv32); {571#false} is VALID [2018-11-23 11:26:43,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {571#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {571#false} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {571#false} is VALID [2018-11-23 11:26:43,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !~bvult32(~i~0, ~n_caracter~0); {571#false} is VALID [2018-11-23 11:26:43,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {571#false} is VALID [2018-11-23 11:26:43,583 INFO L256 TraceCheckUtils]: 18: Hoare triple {571#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {571#false} is VALID [2018-11-23 11:26:43,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-23 11:26:43,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume 0bv32 == ~cond; {571#false} is VALID [2018-11-23 11:26:43,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-23 11:26:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:43,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:43,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {571#false} assume !false; {571#false} is VALID [2018-11-23 11:26:43,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {571#false} assume 0bv32 == ~cond; {571#false} is VALID [2018-11-23 11:26:43,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {571#false} ~cond := #in~cond; {571#false} is VALID [2018-11-23 11:26:43,694 INFO L256 TraceCheckUtils]: 18: Hoare triple {571#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {571#false} is VALID [2018-11-23 11:26:43,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {571#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {571#false} is VALID [2018-11-23 11:26:43,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {571#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#false} assume !~bvult32(~i~0, ~n_caracter~0); {571#false} is VALID [2018-11-23 11:26:43,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {571#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {571#false} is VALID [2018-11-23 11:26:43,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {571#false} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {571#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {571#false} is VALID [2018-11-23 11:26:43,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {571#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {571#false} is VALID [2018-11-23 11:26:43,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(bvult main_~i~0 (_ bv5 32))} assume !~bvult32(~i~0, 5bv32); {571#false} is VALID [2018-11-23 11:26:43,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {679#(bvult main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:26:43,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {683#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {683#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:43,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {683#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:43,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {570#true} call #t~ret17 := main(); {570#true} is VALID [2018-11-23 11:26:43,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {570#true} {570#true} #116#return; {570#true} is VALID [2018-11-23 11:26:43,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2018-11-23 11:26:43,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {570#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {570#true} is VALID [2018-11-23 11:26:43,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2018-11-23 11:26:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:26:43,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:26:43,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:43,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:43,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:43,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:43,830 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 6 states. [2018-11-23 11:26:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:44,766 INFO L93 Difference]: Finished difference Result 111 states and 151 transitions. [2018-11-23 11:26:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:44,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:26:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-23 11:26:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-23 11:26:44,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-23 11:26:45,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:45,176 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:26:45,176 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:26:45,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:26:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 37. [2018-11-23 11:26:45,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:45,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 37 states. [2018-11-23 11:26:45,239 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 37 states. [2018-11-23 11:26:45,239 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 37 states. [2018-11-23 11:26:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:45,249 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2018-11-23 11:26:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2018-11-23 11:26:45,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:45,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:45,254 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 89 states. [2018-11-23 11:26:45,254 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 89 states. [2018-11-23 11:26:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:45,264 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2018-11-23 11:26:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2018-11-23 11:26:45,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:45,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:45,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:45,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:26:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 11:26:45,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 22 [2018-11-23 11:26:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:45,276 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 11:26:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 11:26:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:26:45,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:45,278 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:45,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:45,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash 338373051, now seen corresponding path program 2 times [2018-11-23 11:26:45,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:45,313 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:45,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:26:45,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:45,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:45,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {1094#true} call ULTIMATE.init(); {1094#true} is VALID [2018-11-23 11:26:45,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {1094#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1094#true} is VALID [2018-11-23 11:26:45,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {1094#true} assume true; {1094#true} is VALID [2018-11-23 11:26:45,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1094#true} {1094#true} #116#return; {1094#true} is VALID [2018-11-23 11:26:45,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {1094#true} call #t~ret17 := main(); {1094#true} is VALID [2018-11-23 11:26:45,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {1094#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {1094#true} is VALID [2018-11-23 11:26:45,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {1094#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1094#true} is VALID [2018-11-23 11:26:45,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {1094#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1094#true} is VALID [2018-11-23 11:26:45,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {1094#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1094#true} is VALID [2018-11-23 11:26:45,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1094#true} is VALID [2018-11-23 11:26:45,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {1094#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1094#true} is VALID [2018-11-23 11:26:45,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {1094#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1094#true} is VALID [2018-11-23 11:26:45,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {1094#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1094#true} is VALID [2018-11-23 11:26:45,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {1094#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1094#true} is VALID [2018-11-23 11:26:45,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {1094#true} assume !~bvult32(~i~0, 5bv32); {1094#true} is VALID [2018-11-23 11:26:45,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {1094#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {1094#true} is VALID [2018-11-23 11:26:45,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {1094#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {1094#true} is VALID [2018-11-23 11:26:45,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {1094#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {1094#true} is VALID [2018-11-23 11:26:45,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {1094#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1094#true} is VALID [2018-11-23 11:26:45,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {1094#true} ~cont~0 := 0bv32;~i~0 := 0bv32; {1156#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:26:45,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {1156#(= main_~cont~0 (_ bv0 32))} assume !~bvult32(~i~0, ~n_caracter~0); {1156#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:26:45,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {1156#(= main_~cont~0 (_ bv0 32))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} is VALID [2018-11-23 11:26:45,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} is VALID [2018-11-23 11:26:45,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} is VALID [2018-11-23 11:26:45,528 INFO L256 TraceCheckUtils]: 24: Hoare triple {1163#(and (= main_~cont~0 (_ bv0 32)) (= (_ bv0 32) main_~cont_aux~0))} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {1173#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:45,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {1173#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1177#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:45,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {1177#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1095#false} is VALID [2018-11-23 11:26:45,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {1095#false} assume !false; {1095#false} is VALID [2018-11-23 11:26:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:26:45,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:26:45,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:26:45,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:45,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:45,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:45,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:45,583 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2018-11-23 11:26:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:46,016 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 11:26:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:46,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 11:26:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 11:26:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 11:26:46,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 11:26:46,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:46,345 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:26:46,345 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:26:46,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:26:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-23 11:26:46,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:46,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2018-11-23 11:26:46,371 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2018-11-23 11:26:46,371 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2018-11-23 11:26:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:46,375 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 11:26:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-11-23 11:26:46,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:46,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:46,377 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2018-11-23 11:26:46,377 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2018-11-23 11:26:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:46,380 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 11:26:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2018-11-23 11:26:46,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:46,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:46,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:46,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:26:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 11:26:46,385 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 28 [2018-11-23 11:26:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:46,385 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 11:26:46,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 11:26:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:26:46,387 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:46,387 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 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-23 11:26:46,387 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:46,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2044260908, now seen corresponding path program 1 times [2018-11-23 11:26:46,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:46,388 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:46,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:26:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:46,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:46,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {1452#true} call ULTIMATE.init(); {1452#true} is VALID [2018-11-23 11:26:46,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {1452#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1452#true} is VALID [2018-11-23 11:26:46,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {1452#true} assume true; {1452#true} is VALID [2018-11-23 11:26:46,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1452#true} {1452#true} #116#return; {1452#true} is VALID [2018-11-23 11:26:46,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {1452#true} call #t~ret17 := main(); {1452#true} is VALID [2018-11-23 11:26:46,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {1452#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {1452#true} is VALID [2018-11-23 11:26:46,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {1452#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1452#true} is VALID [2018-11-23 11:26:46,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {1452#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1452#true} is VALID [2018-11-23 11:26:46,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {1452#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1452#true} is VALID [2018-11-23 11:26:46,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {1452#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1452#true} is VALID [2018-11-23 11:26:46,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {1452#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1452#true} is VALID [2018-11-23 11:26:46,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {1452#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1452#true} is VALID [2018-11-23 11:26:46,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {1452#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1452#true} is VALID [2018-11-23 11:26:46,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {1452#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1452#true} is VALID [2018-11-23 11:26:46,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {1452#true} assume !~bvult32(~i~0, 5bv32); {1452#true} is VALID [2018-11-23 11:26:46,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {1452#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {1452#true} is VALID [2018-11-23 11:26:46,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {1452#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {1505#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:26:46,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {1505#(= main_~n_caracter~0 (_ bv0 32))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {1505#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:26:46,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {1505#(= main_~n_caracter~0 (_ bv0 32))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1505#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:26:46,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {1505#(= main_~n_caracter~0 (_ bv0 32))} ~cont~0 := 0bv32;~i~0 := 0bv32; {1505#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:26:46,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {1505#(= main_~n_caracter~0 (_ bv0 32))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {1453#false} is VALID [2018-11-23 11:26:46,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1453#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {1453#false} is VALID [2018-11-23 11:26:46,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1453#false} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1453#false} is VALID [2018-11-23 11:26:46,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {1453#false} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1453#false} is VALID [2018-11-23 11:26:46,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {1453#false} assume !~bvult32(~j~0, 2bv32); {1453#false} is VALID [2018-11-23 11:26:46,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {1453#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1453#false} is VALID [2018-11-23 11:26:46,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {1453#false} assume !~bvult32(~i~0, ~n_caracter~0); {1453#false} is VALID [2018-11-23 11:26:46,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {1453#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {1453#false} is VALID [2018-11-23 11:26:46,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {1453#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1453#false} is VALID [2018-11-23 11:26:46,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {1453#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {1453#false} is VALID [2018-11-23 11:26:46,615 INFO L256 TraceCheckUtils]: 30: Hoare triple {1453#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {1453#false} is VALID [2018-11-23 11:26:46,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {1453#false} ~cond := #in~cond; {1453#false} is VALID [2018-11-23 11:26:46,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {1453#false} assume 0bv32 == ~cond; {1453#false} is VALID [2018-11-23 11:26:46,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {1453#false} assume !false; {1453#false} is VALID [2018-11-23 11:26:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 11:26:46,618 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:46,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:46,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:26:46,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 11:26:46,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:46,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:26:46,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:46,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:26:46,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:26:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:46,685 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 3 states. [2018-11-23 11:26:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:46,897 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2018-11-23 11:26:46,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:26:46,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 11:26:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-23 11:26:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-23 11:26:46,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2018-11-23 11:26:47,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:47,026 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:26:47,026 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:26:47,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:26:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-11-23 11:26:47,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:47,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 53 states. [2018-11-23 11:26:47,070 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 53 states. [2018-11-23 11:26:47,070 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 53 states. [2018-11-23 11:26:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:47,073 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-23 11:26:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 11:26:47,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:47,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:47,075 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 67 states. [2018-11-23 11:26:47,075 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 67 states. [2018-11-23 11:26:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:47,078 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-23 11:26:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 11:26:47,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:47,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:47,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:47,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:26:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-11-23 11:26:47,082 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 34 [2018-11-23 11:26:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:47,082 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-11-23 11:26:47,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:26:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 11:26:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:26:47,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:47,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 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-23 11:26:47,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:47,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1070299053, now seen corresponding path program 1 times [2018-11-23 11:26:47,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:47,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:47,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:47,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-23 11:26:47,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1898#true} is VALID [2018-11-23 11:26:47,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-23 11:26:47,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #116#return; {1898#true} is VALID [2018-11-23 11:26:47,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret17 := main(); {1898#true} is VALID [2018-11-23 11:26:47,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {1918#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:47,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {1918#(= main_~i~0 (_ bv0 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1918#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:47,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {1918#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1925#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:47,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {1925#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1925#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:47,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {1925#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1932#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:47,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {1932#(= (_ bv2 32) main_~i~0)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1932#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:47,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {1932#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1939#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:47,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {1939#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {1939#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:47,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {1939#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1946#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:47,291 INFO L273 TraceCheckUtils]: 14: Hoare triple {1946#(= (_ bv4 32) main_~i~0)} assume !~bvult32(~i~0, 5bv32); {1899#false} is VALID [2018-11-23 11:26:47,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {1899#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {1899#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {1899#false} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {1899#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1899#false} is VALID [2018-11-23 11:26:47,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {1899#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#false} assume !~bvult32(~i~0, ~n_caracter~0); {1899#false} is VALID [2018-11-23 11:26:47,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1899#false} is VALID [2018-11-23 11:26:47,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1899#false} is VALID [2018-11-23 11:26:47,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#false} assume !~bvult32(~j~0, 2bv32); {1899#false} is VALID [2018-11-23 11:26:47,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {1899#false} is VALID [2018-11-23 11:26:47,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {1899#false} is VALID [2018-11-23 11:26:47,295 INFO L256 TraceCheckUtils]: 31: Hoare triple {1899#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {1899#false} is VALID [2018-11-23 11:26:47,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-23 11:26:47,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#false} assume 0bv32 == ~cond; {1899#false} is VALID [2018-11-23 11:26:47,296 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-23 11:26:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:26:47,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:47,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-23 11:26:47,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {1899#false} assume 0bv32 == ~cond; {1899#false} is VALID [2018-11-23 11:26:47,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L256 TraceCheckUtils]: 31: Hoare triple {1899#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {1899#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {1899#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {1899#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {1899#false} assume !~bvult32(~j~0, 2bv32); {1899#false} is VALID [2018-11-23 11:26:47,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {1899#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1899#false} is VALID [2018-11-23 11:26:47,659 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1899#false} is VALID [2018-11-23 11:26:47,659 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {1899#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {1899#false} assume !~bvult32(~i~0, ~n_caracter~0); {1899#false} is VALID [2018-11-23 11:26:47,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {1899#false} ~cont~0 := 0bv32;~i~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {1899#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {1899#false} is VALID [2018-11-23 11:26:47,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {1899#false} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {1899#false} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {1899#false} is VALID [2018-11-23 11:26:47,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {1899#false} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {1899#false} is VALID [2018-11-23 11:26:47,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {2070#(bvult main_~i~0 (_ bv5 32))} assume !~bvult32(~i~0, 5bv32); {1899#false} is VALID [2018-11-23 11:26:47,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {2074#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2070#(bvult main_~i~0 (_ bv5 32))} is VALID [2018-11-23 11:26:47,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {2074#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2074#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {2081#(bvult (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2074#(bvult (bvadd main_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {2081#(bvult (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2081#(bvult (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {2088#(bvult (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2081#(bvult (bvadd main_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {2088#(bvult (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2088#(bvult (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {2095#(bvult (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2088#(bvult (bvadd main_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {2095#(bvult (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2095#(bvult (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {1898#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {2095#(bvult (bvadd main_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 11:26:47,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret17 := main(); {1898#true} is VALID [2018-11-23 11:26:47,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #116#return; {1898#true} is VALID [2018-11-23 11:26:47,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-23 11:26:47,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1898#true} is VALID [2018-11-23 11:26:47,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-23 11:26:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:26:47,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:47,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:26:47,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:26:47,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:47,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:26:47,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:47,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:26:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:26:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:47,844 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 12 states. [2018-11-23 11:26:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,768 INFO L93 Difference]: Finished difference Result 217 states and 297 transitions. [2018-11-23 11:26:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:26:50,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:26:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2018-11-23 11:26:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2018-11-23 11:26:50,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 171 transitions. [2018-11-23 11:26:51,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:51,232 INFO L225 Difference]: With dead ends: 217 [2018-11-23 11:26:51,233 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 11:26:51,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 11:26:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 55. [2018-11-23 11:26:51,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:51,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 55 states. [2018-11-23 11:26:51,397 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 55 states. [2018-11-23 11:26:51,397 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 55 states. [2018-11-23 11:26:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,405 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2018-11-23 11:26:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2018-11-23 11:26:51,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:51,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:51,406 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 179 states. [2018-11-23 11:26:51,406 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 179 states. [2018-11-23 11:26:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,414 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2018-11-23 11:26:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2018-11-23 11:26:51,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:51,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:51,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:51,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:26:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-23 11:26:51,418 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2018-11-23 11:26:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:51,418 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-23 11:26:51,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:26:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 11:26:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:26:51,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:51,420 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 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-23 11:26:51,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:51,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash -393330127, now seen corresponding path program 2 times [2018-11-23 11:26:51,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:51,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:51,446 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:51,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:51,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:51,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:51,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {2852#true} call ULTIMATE.init(); {2852#true} is VALID [2018-11-23 11:26:51,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {2852#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2852#true} is VALID [2018-11-23 11:26:51,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {2852#true} assume true; {2852#true} is VALID [2018-11-23 11:26:51,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2852#true} {2852#true} #116#return; {2852#true} is VALID [2018-11-23 11:26:51,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {2852#true} call #t~ret17 := main(); {2852#true} is VALID [2018-11-23 11:26:51,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {2852#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {2852#true} assume !~bvult32(~i~0, 5bv32); {2852#true} is VALID [2018-11-23 11:26:51,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {2852#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {2852#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {2852#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {2852#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {2852#true} is VALID [2018-11-23 11:26:51,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {2852#true} ~cont~0 := 0bv32;~i~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {2852#true} assume !~bvult32(~i~0, ~n_caracter~0); {2852#true} is VALID [2018-11-23 11:26:51,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {2852#true} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {2852#true} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {2852#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {2932#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:26:51,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {2932#(= main_~j~0 (_ bv0 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {2932#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:26:51,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {2932#(= main_~j~0 (_ bv0 32))} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2932#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:26:51,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {2932#(= main_~j~0 (_ bv0 32))} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2942#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:51,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {2942#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~j~0, 2bv32); {2853#false} is VALID [2018-11-23 11:26:51,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {2853#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {2853#false} is VALID [2018-11-23 11:26:51,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {2853#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {2853#false} is VALID [2018-11-23 11:26:51,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {2853#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {2853#false} is VALID [2018-11-23 11:26:51,668 INFO L256 TraceCheckUtils]: 33: Hoare triple {2853#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {2853#false} is VALID [2018-11-23 11:26:51,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {2853#false} ~cond := #in~cond; {2853#false} is VALID [2018-11-23 11:26:51,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {2853#false} assume 0bv32 == ~cond; {2853#false} is VALID [2018-11-23 11:26:51,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {2853#false} assume !false; {2853#false} is VALID [2018-11-23 11:26:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:26:51,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:51,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {2853#false} assume !false; {2853#false} is VALID [2018-11-23 11:26:51,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {2853#false} assume 0bv32 == ~cond; {2853#false} is VALID [2018-11-23 11:26:51,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {2853#false} ~cond := #in~cond; {2853#false} is VALID [2018-11-23 11:26:51,798 INFO L256 TraceCheckUtils]: 33: Hoare triple {2853#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {2853#false} is VALID [2018-11-23 11:26:51,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {2853#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {2853#false} is VALID [2018-11-23 11:26:51,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {2853#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {2853#false} is VALID [2018-11-23 11:26:51,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {2853#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {2853#false} is VALID [2018-11-23 11:26:51,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {2988#(bvult main_~j~0 (_ bv2 32))} assume !~bvult32(~j~0, 2bv32); {2853#false} is VALID [2018-11-23 11:26:51,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2988#(bvult main_~j~0 (_ bv2 32))} is VALID [2018-11-23 11:26:51,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:51,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {2852#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {2992#(bvult (bvadd main_~j~0 (_ bv1 32)) (_ bv2 32))} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {2852#true} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {2852#true} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {2852#true} assume !~bvult32(~i~0, ~n_caracter~0); {2852#true} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {2852#true} ~cont~0 := 0bv32;~i~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {2852#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {2852#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {2852#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {2852#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {2852#true} assume !~bvult32(~i~0, 5bv32); {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {2852#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2852#true} is VALID [2018-11-23 11:26:51,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {2852#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {2852#true} is VALID [2018-11-23 11:26:51,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {2852#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {2852#true} is VALID [2018-11-23 11:26:51,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {2852#true} call #t~ret17 := main(); {2852#true} is VALID [2018-11-23 11:26:51,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2852#true} {2852#true} #116#return; {2852#true} is VALID [2018-11-23 11:26:51,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {2852#true} assume true; {2852#true} is VALID [2018-11-23 11:26:51,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {2852#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2852#true} is VALID [2018-11-23 11:26:51,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {2852#true} call ULTIMATE.init(); {2852#true} is VALID [2018-11-23 11:26:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:26:51,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:51,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:26:51,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:26:51,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:51,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:51,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:51,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:51,864 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 6 states. [2018-11-23 11:26:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:52,310 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2018-11-23 11:26:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:26:52,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 11:26:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 11:26:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 11:26:52,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2018-11-23 11:26:52,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:52,467 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:26:52,467 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:26:52,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:26:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-11-23 11:26:52,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:52,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 71 states. [2018-11-23 11:26:52,615 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 71 states. [2018-11-23 11:26:52,615 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 71 states. [2018-11-23 11:26:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:52,618 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2018-11-23 11:26:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-23 11:26:52,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:52,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:52,619 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 79 states. [2018-11-23 11:26:52,619 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 79 states. [2018-11-23 11:26:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:52,622 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2018-11-23 11:26:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-23 11:26:52,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:52,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:52,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:52,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:26:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2018-11-23 11:26:52,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 37 [2018-11-23 11:26:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:52,626 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2018-11-23 11:26:52,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2018-11-23 11:26:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:26:52,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:52,628 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:52,628 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:52,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1548396495, now seen corresponding path program 3 times [2018-11-23 11:26:52,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:52,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:52,657 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:52,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:26:52,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:53,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 11:26:53,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-23 11:26:53,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:53,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:53,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:53,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-23 11:26:53,113 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:53,113 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (_ bv0 32))))) (and (= .cse0 |main_#t~mem11|) (= (_ bv0 32) ((_ sign_extend 24) .cse0)))) [2018-11-23 11:26:53,113 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_2]. (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_2))) (and (= ((_ sign_extend 24) .cse0) (_ bv0 32)) (= .cse0 |main_#t~mem11|))) [2018-11-23 11:26:53,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {3488#true} call ULTIMATE.init(); {3488#true} is VALID [2018-11-23 11:26:53,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {3488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3488#true} is VALID [2018-11-23 11:26:53,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {3488#true} assume true; {3488#true} is VALID [2018-11-23 11:26:53,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3488#true} {3488#true} #116#return; {3488#true} is VALID [2018-11-23 11:26:53,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {3488#true} call #t~ret17 := main(); {3488#true} is VALID [2018-11-23 11:26:53,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {3488#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !~bvult32(~i~0, 5bv32); {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,169 INFO L273 TraceCheckUtils]: 17: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:53,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {3508#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {3548#(and (= main_~n_caracter~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:53,171 INFO L273 TraceCheckUtils]: 19: Hoare triple {3548#(and (= main_~n_caracter~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {3552#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= |main_#t~mem4| ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} is VALID [2018-11-23 11:26:53,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {3552#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= |main_#t~mem4| ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:53,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} ~cont~0 := 0bv32;~i~0 := 0bv32; {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:53,175 INFO L273 TraceCheckUtils]: 22: Hoare triple {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !~bvult32(~i~0, ~n_caracter~0); {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:53,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {3556#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {3566#(and (= main_~i~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:53,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {3566#(and (= main_~i~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {3570#(exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_2)) (_ bv0 32)) (= ((_ extract 7 0) v_arrayElimCell_2) |main_#t~mem11|)))} is VALID [2018-11-23 11:26:53,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {3570#(exists ((v_arrayElimCell_2 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_2)) (_ bv0 32)) (= ((_ extract 7 0) v_arrayElimCell_2) |main_#t~mem11|)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {3489#false} is VALID [2018-11-23 11:26:53,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {3489#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {3489#false} is VALID [2018-11-23 11:26:53,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {3489#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3489#false} is VALID [2018-11-23 11:26:53,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {3489#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3489#false} is VALID [2018-11-23 11:26:53,182 INFO L273 TraceCheckUtils]: 29: Hoare triple {3489#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {3489#false} is VALID [2018-11-23 11:26:53,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {3489#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3489#false} is VALID [2018-11-23 11:26:53,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {3489#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3489#false} is VALID [2018-11-23 11:26:53,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {3489#false} assume !~bvult32(~j~0, 2bv32); {3489#false} is VALID [2018-11-23 11:26:53,183 INFO L273 TraceCheckUtils]: 33: Hoare triple {3489#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {3489#false} is VALID [2018-11-23 11:26:53,183 INFO L273 TraceCheckUtils]: 34: Hoare triple {3489#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {3489#false} is VALID [2018-11-23 11:26:53,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {3489#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {3489#false} is VALID [2018-11-23 11:26:53,183 INFO L256 TraceCheckUtils]: 36: Hoare triple {3489#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {3489#false} is VALID [2018-11-23 11:26:53,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {3489#false} ~cond := #in~cond; {3489#false} is VALID [2018-11-23 11:26:53,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {3489#false} assume 0bv32 == ~cond; {3489#false} is VALID [2018-11-23 11:26:53,184 INFO L273 TraceCheckUtils]: 39: Hoare triple {3489#false} assume !false; {3489#false} is VALID [2018-11-23 11:26:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:26:53,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:53,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:53,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:26:53,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:26:53,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:53,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:26:53,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:53,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:26:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:26:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:26:53,230 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 8 states. [2018-11-23 11:26:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:54,290 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2018-11-23 11:26:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:26:54,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-23 11:26:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:26:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:26:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:26:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 11:26:54,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 11:26:54,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:54,392 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:26:54,392 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:26:54,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:26:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 11:26:54,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:54,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2018-11-23 11:26:54,540 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-23 11:26:54,541 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-23 11:26:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:54,544 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 11:26:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 11:26:54,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:54,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:54,545 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-23 11:26:54,545 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-23 11:26:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:54,548 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 11:26:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 11:26:54,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:54,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:54,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:54,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:26:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-23 11:26:54,551 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 40 [2018-11-23 11:26:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:54,552 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-23 11:26:54,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:26:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 11:26:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:26:54,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:54,553 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 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-23 11:26:54,553 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:54,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash 204425664, now seen corresponding path program 1 times [2018-11-23 11:26:54,554 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:54,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:26:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:54,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:54,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:26:54,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:26:54,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:54,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:54,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:54,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 11:26:54,942 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:54,942 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (_ bv0 32))))) (and (= .cse0 |main_#t~mem11|) (not (= (_ bv0 32) ((_ sign_extend 24) .cse0))))) [2018-11-23 11:26:54,942 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_4]. (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_4))) (and (= .cse0 |main_#t~mem11|) (not (= (_ bv0 32) ((_ sign_extend 24) .cse0))))) [2018-11-23 11:26:54,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {4001#true} call ULTIMATE.init(); {4001#true} is VALID [2018-11-23 11:26:54,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {4001#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4001#true} is VALID [2018-11-23 11:26:54,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:26:54,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4001#true} {4001#true} #116#return; {4001#true} is VALID [2018-11-23 11:26:54,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {4001#true} call #t~ret17 := main(); {4001#true} is VALID [2018-11-23 11:26:54,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {4001#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !~bvult32(~i~0, 5bv32); {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} is VALID [2018-11-23 11:26:54,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {4021#(= (_ bv0 32) |main_~#input_string~0.offset|)} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {4061#(and (= main_~n_caracter~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {4061#(and (= main_~n_caracter~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4065#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= |main_#t~mem4| ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} is VALID [2018-11-23 11:26:54,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {4065#(and (= (_ bv0 32) |main_~#input_string~0.offset|) (= |main_#t~mem4| ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} ~cont~0 := 0bv32;~i~0 := 0bv32; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !~bvult32(~j~0, 2bv32); {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} assume !~bvult32(~i~0, ~n_caracter~0); {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {4069#(and (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {4112#(and (= main_~i~0 (_ bv0 32)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} is VALID [2018-11-23 11:26:54,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {4112#(and (= main_~i~0 (_ bv0 32)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))) (= (_ bv0 32) |main_~#input_string~0.offset|))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4116#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ extract 7 0) v_arrayElimCell_4) |main_#t~mem11|) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_4))))))} is VALID [2018-11-23 11:26:54,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {4116#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= ((_ extract 7 0) v_arrayElimCell_4) |main_#t~mem11|) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_4))))))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {4002#false} is VALID [2018-11-23 11:26:54,994 INFO L256 TraceCheckUtils]: 37: Hoare triple {4002#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {4002#false} is VALID [2018-11-23 11:26:54,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {4002#false} ~cond := #in~cond; {4002#false} is VALID [2018-11-23 11:26:54,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {4002#false} assume 0bv32 == ~cond; {4002#false} is VALID [2018-11-23 11:26:54,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {4002#false} assume !false; {4002#false} is VALID [2018-11-23 11:26:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 11:26:54,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:55,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 11:26:57,332 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#input_string~0.offset| (bvadd |main_~#input_string~0.offset| main_~n_caracter~0)) [2018-11-23 11:26:57,335 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:57,335 INFO L303 Elim1Store]: Index analysis took 2024 ms [2018-11-23 11:26:57,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-11-23 11:26:57,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:57,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:57,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:57,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2018-11-23 11:26:57,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:57,359 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#input_string~0.base|))) (or (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd |main_~#input_string~0.offset| main_~n_caracter~0))))) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 |main_~#input_string~0.offset|))))))) [2018-11-23 11:26:57,359 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= |main_~#input_string~0.offset| (bvadd |main_~#input_string~0.offset| main_~n_caracter~0)) [2018-11-23 11:26:57,395 INFO L273 TraceCheckUtils]: 40: Hoare triple {4002#false} assume !false; {4002#false} is VALID [2018-11-23 11:26:57,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {4002#false} assume 0bv32 == ~cond; {4002#false} is VALID [2018-11-23 11:26:57,395 INFO L273 TraceCheckUtils]: 38: Hoare triple {4002#false} ~cond := #in~cond; {4002#false} is VALID [2018-11-23 11:26:57,396 INFO L256 TraceCheckUtils]: 37: Hoare triple {4002#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {4002#false} is VALID [2018-11-23 11:26:57,413 INFO L273 TraceCheckUtils]: 36: Hoare triple {4144#(not (= ((_ sign_extend 24) |main_#t~mem11|) (_ bv0 32)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {4002#false} is VALID [2018-11-23 11:26:57,427 INFO L273 TraceCheckUtils]: 35: Hoare triple {4148#(not (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0)))) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4144#(not (= ((_ sign_extend 24) |main_#t~mem11|) (_ bv0 32)))} is VALID [2018-11-23 11:26:57,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {4148#(not (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0)))) (_ bv0 32)))} is VALID [2018-11-23 11:26:57,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !~bvult32(~i~0, ~n_caracter~0); {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !~bvult32(~j~0, 2bv32); {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,449 INFO L273 TraceCheckUtils]: 28: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,460 INFO L273 TraceCheckUtils]: 25: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} ~cont~0 := 0bv32;~i~0 := 0bv32; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,466 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {4195#(or (= ((_ sign_extend 24) |main_#t~mem4|) (_ bv0 32)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4152#(not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))))} is VALID [2018-11-23 11:26:57,468 INFO L273 TraceCheckUtils]: 19: Hoare triple {4199#(= (_ bv0 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4195#(or (= ((_ sign_extend 24) |main_#t~mem4|) (_ bv0 32)) (not (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))))} is VALID [2018-11-23 11:26:57,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {4001#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {4199#(= (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:26:57,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {4001#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {4001#true} is VALID [2018-11-23 11:26:57,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {4001#true} assume !~bvult32(~i~0, 5bv32); {4001#true} is VALID [2018-11-23 11:26:57,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {4001#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {4001#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {4001#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {4001#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {4001#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {4001#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {4001#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#true} is VALID [2018-11-23 11:26:57,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {4001#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4001#true} is VALID [2018-11-23 11:26:57,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {4001#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4001#true} is VALID [2018-11-23 11:26:57,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {4001#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4001#true} is VALID [2018-11-23 11:26:57,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {4001#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {4001#true} is VALID [2018-11-23 11:26:57,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {4001#true} call #t~ret17 := main(); {4001#true} is VALID [2018-11-23 11:26:57,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4001#true} {4001#true} #116#return; {4001#true} is VALID [2018-11-23 11:26:57,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {4001#true} assume true; {4001#true} is VALID [2018-11-23 11:26:57,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {4001#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4001#true} is VALID [2018-11-23 11:26:57,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {4001#true} call ULTIMATE.init(); {4001#true} is VALID [2018-11-23 11:26:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 11:26:57,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:57,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 11:26:57,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 11:26:57,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:57,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:26:59,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:59,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:26:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:26:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:26:59,609 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 13 states. [2018-11-23 11:27:00,837 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-11-23 11:27:02,088 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-11-23 11:27:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:02,597 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2018-11-23 11:27:02,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:27:02,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-23 11:27:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:27:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-23 11:27:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:27:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2018-11-23 11:27:02,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 79 transitions. [2018-11-23 11:27:03,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:03,209 INFO L225 Difference]: With dead ends: 147 [2018-11-23 11:27:03,209 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 11:27:03,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:27:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 11:27:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 71. [2018-11-23 11:27:03,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:03,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 71 states. [2018-11-23 11:27:03,771 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 71 states. [2018-11-23 11:27:03,771 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 71 states. [2018-11-23 11:27:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:03,777 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 11:27:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2018-11-23 11:27:03,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:03,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:03,778 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 142 states. [2018-11-23 11:27:03,778 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 142 states. [2018-11-23 11:27:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:03,784 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 11:27:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2018-11-23 11:27:03,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:03,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:03,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:03,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:27:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2018-11-23 11:27:03,788 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 41 [2018-11-23 11:27:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:03,789 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-11-23 11:27:03,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:27:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2018-11-23 11:27:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:27:03,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:03,790 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:03,790 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:03,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1762219626, now seen corresponding path program 1 times [2018-11-23 11:27:03,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:03,791 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:03,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:03,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:04,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {4863#true} call ULTIMATE.init(); {4863#true} is VALID [2018-11-23 11:27:04,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {4863#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4863#true} is VALID [2018-11-23 11:27:04,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {4863#true} assume true; {4863#true} is VALID [2018-11-23 11:27:04,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4863#true} {4863#true} #116#return; {4863#true} is VALID [2018-11-23 11:27:04,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {4863#true} call #t~ret17 := main(); {4863#true} is VALID [2018-11-23 11:27:04,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {4863#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {4863#true} is VALID [2018-11-23 11:27:04,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {4863#true} assume !~bvult32(~i~0, 5bv32); {4863#true} is VALID [2018-11-23 11:27:04,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {4863#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {4863#true} is VALID [2018-11-23 11:27:04,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {4863#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {4922#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:27:04,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {4922#(= main_~n_caracter~0 (_ bv0 32))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4922#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:27:04,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {4922#(= main_~n_caracter~0 (_ bv0 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4929#(= (_ bv1 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,174 INFO L273 TraceCheckUtils]: 21: Hoare triple {4929#(= (_ bv1 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {4929#(= (_ bv1 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {4929#(= (_ bv1 32) main_~n_caracter~0)} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {4929#(= (_ bv1 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {4929#(= (_ bv1 32) main_~n_caracter~0)} ~cont~0 := 0bv32;~i~0 := 0bv32; {4939#(and (= (_ bv1 32) main_~n_caracter~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:27:04,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {4939#(and (= (_ bv1 32) main_~n_caracter~0) (= main_~i~0 (_ bv0 32)))} assume !~bvult32(~i~0, ~n_caracter~0); {4864#false} is VALID [2018-11-23 11:27:04,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {4864#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {4864#false} is VALID [2018-11-23 11:27:04,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {4864#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {4864#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {4864#false} is VALID [2018-11-23 11:27:04,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {4864#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,176 INFO L273 TraceCheckUtils]: 29: Hoare triple {4864#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4864#false} is VALID [2018-11-23 11:27:04,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {4864#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4864#false} is VALID [2018-11-23 11:27:04,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {4864#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {4864#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4864#false} is VALID [2018-11-23 11:27:04,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {4864#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4864#false} is VALID [2018-11-23 11:27:04,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {4864#false} assume !~bvult32(~j~0, 2bv32); {4864#false} is VALID [2018-11-23 11:27:04,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {4864#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4864#false} is VALID [2018-11-23 11:27:04,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {4864#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {4864#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {4864#false} is VALID [2018-11-23 11:27:04,179 INFO L256 TraceCheckUtils]: 38: Hoare triple {4864#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {4864#false} is VALID [2018-11-23 11:27:04,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {4864#false} ~cond := #in~cond; {4864#false} is VALID [2018-11-23 11:27:04,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {4864#false} assume 0bv32 == ~cond; {4864#false} is VALID [2018-11-23 11:27:04,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {4864#false} assume !false; {4864#false} is VALID [2018-11-23 11:27:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:27:04,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:04,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {4864#false} assume !false; {4864#false} is VALID [2018-11-23 11:27:04,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {4864#false} assume 0bv32 == ~cond; {4864#false} is VALID [2018-11-23 11:27:04,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {4864#false} ~cond := #in~cond; {4864#false} is VALID [2018-11-23 11:27:04,273 INFO L256 TraceCheckUtils]: 38: Hoare triple {4864#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {4864#false} is VALID [2018-11-23 11:27:04,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {4864#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {4864#false} is VALID [2018-11-23 11:27:04,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {4864#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {4864#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {4864#false} is VALID [2018-11-23 11:27:04,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {4864#false} assume !~bvult32(~j~0, 2bv32); {4864#false} is VALID [2018-11-23 11:27:04,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {4864#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4864#false} is VALID [2018-11-23 11:27:04,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {4864#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4864#false} is VALID [2018-11-23 11:27:04,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {4864#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {4864#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4864#false} is VALID [2018-11-23 11:27:04,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {4864#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4864#false} is VALID [2018-11-23 11:27:04,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {4864#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {4864#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {4864#false} is VALID [2018-11-23 11:27:04,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {4864#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {4864#false} is VALID [2018-11-23 11:27:04,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {4864#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {4864#false} is VALID [2018-11-23 11:27:04,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {5045#(bvult main_~i~0 main_~n_caracter~0)} assume !~bvult32(~i~0, ~n_caracter~0); {4864#false} is VALID [2018-11-23 11:27:04,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {5049#(bvult (_ bv0 32) main_~n_caracter~0)} ~cont~0 := 0bv32;~i~0 := 0bv32; {5045#(bvult main_~i~0 main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {5049#(bvult (_ bv0 32) main_~n_caracter~0)} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {5049#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {5049#(bvult (_ bv0 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {5049#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {5059#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {5049#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:04,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {5059#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {5059#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} is VALID [2018-11-23 11:27:04,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {4863#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {5059#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} is VALID [2018-11-23 11:27:04,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {4863#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {4863#true} is VALID [2018-11-23 11:27:04,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {4863#true} assume !~bvult32(~i~0, 5bv32); {4863#true} is VALID [2018-11-23 11:27:04,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {4863#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {4863#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {4863#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {4863#true} call #t~ret17 := main(); {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4863#true} {4863#true} #116#return; {4863#true} is VALID [2018-11-23 11:27:04,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {4863#true} assume true; {4863#true} is VALID [2018-11-23 11:27:04,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {4863#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4863#true} is VALID [2018-11-23 11:27:04,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {4863#true} call ULTIMATE.init(); {4863#true} is VALID [2018-11-23 11:27:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:27:04,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:04,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:27:04,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 11:27:04,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:04,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:27:04,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:04,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:27:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:27:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:27:04,344 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand 8 states. [2018-11-23 11:27:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:05,810 INFO L93 Difference]: Finished difference Result 272 states and 356 transitions. [2018-11-23 11:27:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:27:05,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 11:27:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:27:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-23 11:27:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:27:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-23 11:27:05,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2018-11-23 11:27:06,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:06,061 INFO L225 Difference]: With dead ends: 272 [2018-11-23 11:27:06,062 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 11:27:06,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:27:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 11:27:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 79. [2018-11-23 11:27:06,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:06,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 79 states. [2018-11-23 11:27:06,215 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 79 states. [2018-11-23 11:27:06,215 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 79 states. [2018-11-23 11:27:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:06,223 INFO L93 Difference]: Finished difference Result 246 states and 321 transitions. [2018-11-23 11:27:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 321 transitions. [2018-11-23 11:27:06,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:06,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:06,224 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 246 states. [2018-11-23 11:27:06,224 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 246 states. [2018-11-23 11:27:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:06,231 INFO L93 Difference]: Finished difference Result 246 states and 321 transitions. [2018-11-23 11:27:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 321 transitions. [2018-11-23 11:27:06,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:06,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:06,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:06,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:27:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2018-11-23 11:27:06,234 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 42 [2018-11-23 11:27:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:06,234 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-11-23 11:27:06,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:27:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2018-11-23 11:27:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:27:06,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:06,235 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:06,235 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:06,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash -452935237, now seen corresponding path program 2 times [2018-11-23 11:27:06,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:06,236 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:06,261 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:27:06,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:27:06,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:27:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:06,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:06,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {6118#true} call ULTIMATE.init(); {6118#true} is VALID [2018-11-23 11:27:06,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {6118#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6118#true} is VALID [2018-11-23 11:27:06,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {6118#true} assume true; {6118#true} is VALID [2018-11-23 11:27:06,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6118#true} {6118#true} #116#return; {6118#true} is VALID [2018-11-23 11:27:06,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {6118#true} call #t~ret17 := main(); {6118#true} is VALID [2018-11-23 11:27:06,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {6118#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {6118#true} is VALID [2018-11-23 11:27:06,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {6118#true} assume !~bvult32(~i~0, 5bv32); {6118#true} is VALID [2018-11-23 11:27:06,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {6118#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {6118#true} is VALID [2018-11-23 11:27:06,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {6118#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {6177#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:27:06,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {6177#(= main_~n_caracter~0 (_ bv0 32))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6177#(= main_~n_caracter~0 (_ bv0 32))} is VALID [2018-11-23 11:27:06,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {6177#(= main_~n_caracter~0 (_ bv0 32))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6184#(= (_ bv1 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {6184#(= (_ bv1 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6184#(= (_ bv1 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {6184#(= (_ bv1 32) main_~n_caracter~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6191#(= (_ bv2 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {6191#(= (_ bv2 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6191#(= (_ bv2 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {6191#(= (_ bv2 32) main_~n_caracter~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6198#(= (_ bv3 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {6198#(= (_ bv3 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6198#(= (_ bv3 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {6198#(= (_ bv3 32) main_~n_caracter~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6205#(= (_ bv4 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {6205#(= (_ bv4 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6205#(= (_ bv4 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {6205#(= (_ bv4 32) main_~n_caracter~0)} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {6205#(= (_ bv4 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {6205#(= (_ bv4 32) main_~n_caracter~0)} ~cont~0 := 0bv32;~i~0 := 0bv32; {6215#(and (= main_~i~0 (_ bv0 32)) (= (_ bv4 32) main_~n_caracter~0))} is VALID [2018-11-23 11:27:06,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {6215#(and (= main_~i~0 (_ bv0 32)) (= (_ bv4 32) main_~n_caracter~0))} assume !~bvult32(~i~0, ~n_caracter~0); {6119#false} is VALID [2018-11-23 11:27:06,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {6119#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {6119#false} is VALID [2018-11-23 11:27:06,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {6119#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {6119#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {6119#false} is VALID [2018-11-23 11:27:06,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {6119#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,775 INFO L273 TraceCheckUtils]: 35: Hoare triple {6119#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6119#false} is VALID [2018-11-23 11:27:06,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {6119#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6119#false} is VALID [2018-11-23 11:27:06,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {6119#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {6119#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6119#false} is VALID [2018-11-23 11:27:06,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {6119#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6119#false} is VALID [2018-11-23 11:27:06,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {6119#false} assume !~bvult32(~j~0, 2bv32); {6119#false} is VALID [2018-11-23 11:27:06,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {6119#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {6119#false} is VALID [2018-11-23 11:27:06,776 INFO L273 TraceCheckUtils]: 42: Hoare triple {6119#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,776 INFO L273 TraceCheckUtils]: 43: Hoare triple {6119#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {6119#false} is VALID [2018-11-23 11:27:06,776 INFO L256 TraceCheckUtils]: 44: Hoare triple {6119#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {6119#false} is VALID [2018-11-23 11:27:06,777 INFO L273 TraceCheckUtils]: 45: Hoare triple {6119#false} ~cond := #in~cond; {6119#false} is VALID [2018-11-23 11:27:06,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {6119#false} assume 0bv32 == ~cond; {6119#false} is VALID [2018-11-23 11:27:06,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {6119#false} assume !false; {6119#false} is VALID [2018-11-23 11:27:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:27:06,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:06,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {6119#false} assume !false; {6119#false} is VALID [2018-11-23 11:27:06,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {6119#false} assume 0bv32 == ~cond; {6119#false} is VALID [2018-11-23 11:27:06,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {6119#false} ~cond := #in~cond; {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L256 TraceCheckUtils]: 44: Hoare triple {6119#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {6119#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 42: Hoare triple {6119#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {6119#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {6119#false} assume !~bvult32(~j~0, 2bv32); {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {6119#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6119#false} is VALID [2018-11-23 11:27:06,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {6119#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {6119#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {6119#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 35: Hoare triple {6119#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 34: Hoare triple {6119#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {6119#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {6119#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {6119#false} is VALID [2018-11-23 11:27:06,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {6119#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {6119#false} is VALID [2018-11-23 11:27:06,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {6321#(bvult main_~i~0 main_~n_caracter~0)} assume !~bvult32(~i~0, ~n_caracter~0); {6119#false} is VALID [2018-11-23 11:27:06,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {6325#(bvult (_ bv0 32) main_~n_caracter~0)} ~cont~0 := 0bv32;~i~0 := 0bv32; {6321#(bvult main_~i~0 main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {6325#(bvult (_ bv0 32) main_~n_caracter~0)} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {6325#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,960 INFO L273 TraceCheckUtils]: 27: Hoare triple {6325#(bvult (_ bv0 32) main_~n_caracter~0)} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6325#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,960 INFO L273 TraceCheckUtils]: 26: Hoare triple {6335#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6325#(bvult (_ bv0 32) main_~n_caracter~0)} is VALID [2018-11-23 11:27:06,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {6335#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6335#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} is VALID [2018-11-23 11:27:06,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {6342#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv2 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6335#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv1 32)))} is VALID [2018-11-23 11:27:06,962 INFO L273 TraceCheckUtils]: 23: Hoare triple {6342#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv2 32)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6342#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv2 32)))} is VALID [2018-11-23 11:27:06,962 INFO L273 TraceCheckUtils]: 22: Hoare triple {6349#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv3 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6342#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv2 32)))} is VALID [2018-11-23 11:27:06,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {6349#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv3 32)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6349#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv3 32)))} is VALID [2018-11-23 11:27:06,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {6356#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv4 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {6349#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv3 32)))} is VALID [2018-11-23 11:27:06,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {6356#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv4 32)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {6356#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv4 32)))} is VALID [2018-11-23 11:27:06,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {6118#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {6356#(bvult (_ bv0 32) (bvadd main_~n_caracter~0 (_ bv4 32)))} is VALID [2018-11-23 11:27:06,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {6118#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {6118#true} is VALID [2018-11-23 11:27:06,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {6118#true} assume !~bvult32(~i~0, 5bv32); {6118#true} is VALID [2018-11-23 11:27:06,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {6118#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {6118#true} is VALID [2018-11-23 11:27:06,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {6118#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {6118#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {6118#true} call #t~ret17 := main(); {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6118#true} {6118#true} #116#return; {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {6118#true} assume true; {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {6118#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6118#true} is VALID [2018-11-23 11:27:06,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {6118#true} call ULTIMATE.init(); {6118#true} is VALID [2018-11-23 11:27:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 11:27:06,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:06,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:27:06,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:27:06,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:06,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:27:07,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:07,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:27:07,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:27:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:27:07,043 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 14 states. [2018-11-23 11:27:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:13,887 INFO L93 Difference]: Finished difference Result 702 states and 935 transitions. [2018-11-23 11:27:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:27:13,887 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:27:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:27:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 359 transitions. [2018-11-23 11:27:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:27:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 359 transitions. [2018-11-23 11:27:13,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 359 transitions. [2018-11-23 11:27:15,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:15,035 INFO L225 Difference]: With dead ends: 702 [2018-11-23 11:27:15,036 INFO L226 Difference]: Without dead ends: 673 [2018-11-23 11:27:15,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:27:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-23 11:27:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 108. [2018-11-23 11:27:15,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:15,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 673 states. Second operand 108 states. [2018-11-23 11:27:15,667 INFO L74 IsIncluded]: Start isIncluded. First operand 673 states. Second operand 108 states. [2018-11-23 11:27:15,667 INFO L87 Difference]: Start difference. First operand 673 states. Second operand 108 states. [2018-11-23 11:27:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:15,700 INFO L93 Difference]: Finished difference Result 673 states and 892 transitions. [2018-11-23 11:27:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2018-11-23 11:27:15,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:15,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:15,702 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 673 states. [2018-11-23 11:27:15,703 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 673 states. [2018-11-23 11:27:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:15,739 INFO L93 Difference]: Finished difference Result 673 states and 892 transitions. [2018-11-23 11:27:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2018-11-23 11:27:15,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:15,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:15,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:15,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:27:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2018-11-23 11:27:15,747 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 48 [2018-11-23 11:27:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:15,747 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2018-11-23 11:27:15,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:27:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2018-11-23 11:27:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:27:15,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:15,749 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-23 11:27:15,749 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:15,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash -57035726, now seen corresponding path program 1 times [2018-11-23 11:27:15,750 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:15,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:15,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:27:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:15,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:16,429 INFO L256 TraceCheckUtils]: 0: Hoare triple {8940#true} call ULTIMATE.init(); {8940#true} is VALID [2018-11-23 11:27:16,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {8940#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {8940#true} is VALID [2018-11-23 11:27:16,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {8940#true} assume true; {8940#true} is VALID [2018-11-23 11:27:16,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8940#true} {8940#true} #116#return; {8940#true} is VALID [2018-11-23 11:27:16,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {8940#true} call #t~ret17 := main(); {8940#true} is VALID [2018-11-23 11:27:16,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {8940#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {8940#true} is VALID [2018-11-23 11:27:16,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {8940#true} assume !~bvult32(~i~0, 5bv32); {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {8940#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {8940#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {8940#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {8940#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {8940#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {8940#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {8940#true} is VALID [2018-11-23 11:27:16,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {8940#true} ~cont~0 := 0bv32;~i~0 := 0bv32; {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,435 INFO L273 TraceCheckUtils]: 27: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,436 INFO L273 TraceCheckUtils]: 29: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~j~0, 2bv32); {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~n_caracter~0); {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,441 INFO L273 TraceCheckUtils]: 36: Hoare triple {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {9050#(and (= (_ bv0 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {9063#(and (= (_ bv1 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,448 INFO L273 TraceCheckUtils]: 42: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,449 INFO L273 TraceCheckUtils]: 43: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvult32(~j~0, 2bv32); {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,450 INFO L273 TraceCheckUtils]: 44: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,451 INFO L273 TraceCheckUtils]: 45: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,452 INFO L273 TraceCheckUtils]: 46: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:27:16,453 INFO L256 TraceCheckUtils]: 47: Hoare triple {9073#(and (= (_ bv2 32) main_~cont_aux~0) (= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {9092#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {9092#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {9096#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {9096#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {8941#false} is VALID [2018-11-23 11:27:16,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {8941#false} assume !false; {8941#false} is VALID [2018-11-23 11:27:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:27:16,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:16,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {8941#false} assume !false; {8941#false} is VALID [2018-11-23 11:27:16,643 INFO L273 TraceCheckUtils]: 49: Hoare triple {9106#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {8941#false} is VALID [2018-11-23 11:27:16,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {9110#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {9106#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:27:16,644 INFO L256 TraceCheckUtils]: 47: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {9110#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:27:16,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} assume !~bvult32(~j~0, 2bv32); {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,648 INFO L273 TraceCheckUtils]: 42: Hoare triple {9114#(= main_~cont~0 main_~cont_aux~0)} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {9114#(= main_~cont~0 main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {9133#(= (bvadd main_~cont~0 (_ bv4294967295 32)) main_~cont_aux~0)} is VALID [2018-11-23 11:27:16,673 INFO L273 TraceCheckUtils]: 37: Hoare triple {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} is VALID [2018-11-23 11:27:16,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} is VALID [2018-11-23 11:27:16,673 INFO L273 TraceCheckUtils]: 35: Hoare triple {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} is VALID [2018-11-23 11:27:16,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {9143#(= (bvadd main_~cont_aux~0 (_ bv2 32)) main_~cont~0)} is VALID [2018-11-23 11:27:16,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~i~0, ~n_caracter~0); {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvult32(~j~0, 2bv32); {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {9034#(= (bvadd main_~cont~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {9024#(= (bvadd main_~cont~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:27:16,703 INFO L273 TraceCheckUtils]: 25: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {9014#(= main_~cont~0 (_ bv0 32))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {8940#true} ~cont~0 := 0bv32;~i~0 := 0bv32; {9014#(= main_~cont~0 (_ bv0 32))} is VALID [2018-11-23 11:27:16,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {8940#true} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {8940#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {8940#true} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {8940#true} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {8940#true} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {8940#true} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {8940#true} assume !~bvult32(~i~0, 5bv32); {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {8940#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {8940#true} is VALID [2018-11-23 11:27:16,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {8940#true} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {8940#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {8940#true} call #t~ret17 := main(); {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8940#true} {8940#true} #116#return; {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {8940#true} assume true; {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {8940#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {8940#true} is VALID [2018-11-23 11:27:16,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {8940#true} call ULTIMATE.init(); {8940#true} is VALID [2018-11-23 11:27:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:27:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-11-23 11:27:16,711 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-23 11:27:16,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:16,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:27:16,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:16,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:27:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:27:16,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:27:16,834 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand 15 states. [2018-11-23 11:27:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:20,337 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2018-11-23 11:27:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:27:20,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-23 11:27:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:27:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2018-11-23 11:27:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:27:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2018-11-23 11:27:20,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 155 transitions. [2018-11-23 11:27:21,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:21,015 INFO L225 Difference]: With dead ends: 234 [2018-11-23 11:27:21,015 INFO L226 Difference]: Without dead ends: 228 [2018-11-23 11:27:21,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:27:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-23 11:27:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 162. [2018-11-23 11:27:21,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:21,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand 162 states. [2018-11-23 11:27:21,521 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 162 states. [2018-11-23 11:27:21,521 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 162 states. [2018-11-23 11:27:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:21,528 INFO L93 Difference]: Finished difference Result 228 states and 300 transitions. [2018-11-23 11:27:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-11-23 11:27:21,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:21,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:21,529 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 228 states. [2018-11-23 11:27:21,529 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 228 states. [2018-11-23 11:27:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:21,535 INFO L93 Difference]: Finished difference Result 228 states and 300 transitions. [2018-11-23 11:27:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 300 transitions. [2018-11-23 11:27:21,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:21,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:21,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:21,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:27:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2018-11-23 11:27:21,540 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 51 [2018-11-23 11:27:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:21,541 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2018-11-23 11:27:21,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:27:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2018-11-23 11:27:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:27:21,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:21,542 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-23 11:27:21,542 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:21,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash -450062736, now seen corresponding path program 1 times [2018-11-23 11:27:21,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:27:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:27:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:27:21,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:27:22,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:27:22,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:22,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:27:22,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-23 11:27:22,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 11:27:22,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:27:22,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:22,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:27:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:27:22,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-11-23 11:27:22,467 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:22,467 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |v_main_#t~nondet2_8|]. (let ((.cse0 (select |v_#memory_int_16| |main_~#vogal_array~0.base|))) (and (= (store |v_#memory_int_16| |main_~#input_string~0.base| (store (select |v_#memory_int_16| |main_~#input_string~0.base|) |main_~#input_string~0.offset| ((_ sign_extend 24) |v_main_#t~nondet2_8|))) |#memory_int|) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= ((_ sign_extend 24) (_ bv97 8)) (select .cse0 |main_~#vogal_array~0.offset|)) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)) (= (select .cse0 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))))) [2018-11-23 11:27:22,467 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_#t~nondet2_8|]. (let ((.cse0 (select |#memory_int| |main_~#vogal_array~0.base|))) (and (= ((_ sign_extend 24) (_ bv97 8)) (select .cse0 |main_~#vogal_array~0.offset|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select .cse0 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) [2018-11-23 11:27:22,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 11:27:22,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 11:27:22,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:27:22,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:27:22,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:22,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:85 [2018-11-23 11:27:22,781 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:22,781 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~i~0, |v_main_#t~nondet2_9|, |v_main_#t~nondet2_8|]. (let ((.cse0 (select |v_#memory_int_17| |main_~#input_string~0.base|)) (.cse1 (select |v_#memory_int_17| |main_~#vogal_array~0.base|))) (and (= (select .cse0 |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= ((_ sign_extend 24) (_ bv97 8)) (select .cse1 |main_~#vogal_array~0.offset|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (store |v_#memory_int_17| |main_~#input_string~0.base| (store .cse0 (bvadd |main_~#input_string~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet2_9|))) |#memory_int|) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)) (= (select .cse1 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))))) [2018-11-23 11:27:22,781 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_1, |v_main_#t~nondet2_8|, |v_main_#t~nondet2_9|]. (let ((.cse0 (select |#memory_int| |main_~#input_string~0.base|)) (.cse7 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse1 (= ((_ sign_extend 24) (_ bv97 8)) (select .cse7 |main_~#vogal_array~0.offset|))) (.cse3 (= |main_~#vogal_array~0.offset| (_ bv0 32))) (.cse4 (= (select .cse7 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8)))) (.cse2 (select .cse0 |main_~#input_string~0.offset|)) (.cse5 (= (_ bv0 32) |main_~#input_string~0.offset|)) (.cse6 (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) (or (and (= (select .cse0 (bvadd |main_~#input_string~0.offset| main_~i~0)) ((_ sign_extend 24) v_prenex_1)) .cse1 (= .cse2 ((_ sign_extend 24) |v_main_#t~nondet2_8|)) .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse3 .cse4 (= .cse2 ((_ sign_extend 24) |v_main_#t~nondet2_9|)) .cse5 .cse6)))) [2018-11-23 11:27:22,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 11:27:22,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 11:27:22,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:27:22,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:27:23,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:23,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:85 [2018-11-23 11:27:23,034 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:23,035 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~i~0, |v_main_#t~nondet2_10|, |v_main_#t~nondet2_8|]. (let ((.cse1 (select |v_#memory_int_18| |main_~#input_string~0.base|)) (.cse0 (select |v_#memory_int_18| |main_~#vogal_array~0.base|))) (and (= (select .cse0 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (select .cse1 |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (store |v_#memory_int_18| |main_~#input_string~0.base| (store .cse1 (bvadd |main_~#input_string~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet2_10|))) |#memory_int|) (= ((_ sign_extend 24) (_ bv97 8)) (select .cse0 |main_~#vogal_array~0.offset|)) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) [2018-11-23 11:27:23,035 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_2, |v_main_#t~nondet2_8|, |v_main_#t~nondet2_10|]. (let ((.cse5 (select |#memory_int| |main_~#input_string~0.base|)) (.cse7 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse0 (= ((_ sign_extend 24) (_ bv97 8)) (select .cse7 |main_~#vogal_array~0.offset|))) (.cse2 (= |main_~#vogal_array~0.offset| (_ bv0 32))) (.cse3 (= (select .cse7 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8)))) (.cse1 (select .cse5 |main_~#input_string~0.offset|)) (.cse4 (= (_ bv0 32) |main_~#input_string~0.offset|)) (.cse6 (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) (or (and .cse0 (= .cse1 ((_ sign_extend 24) |v_main_#t~nondet2_8|)) .cse2 .cse3 .cse4 (= (select .cse5 (bvadd |main_~#input_string~0.offset| main_~i~0)) ((_ sign_extend 24) v_prenex_2)) .cse6) (and .cse0 .cse2 .cse3 (= .cse1 ((_ sign_extend 24) |v_main_#t~nondet2_10|)) .cse4 .cse6)))) [2018-11-23 11:27:23,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 11:27:23,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 11:27:23,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:27:23,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:27:23,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:23,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:85 [2018-11-23 11:27:23,320 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:23,320 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~i~0, |v_main_#t~nondet2_11|, |v_main_#t~nondet2_8|]. (let ((.cse0 (select |v_#memory_int_19| |main_~#vogal_array~0.base|)) (.cse1 (select |v_#memory_int_19| |main_~#input_string~0.base|))) (and (= ((_ sign_extend 24) (_ bv97 8)) (select .cse0 |main_~#vogal_array~0.offset|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select .cse1 |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= (select .cse0 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (store |v_#memory_int_19| |main_~#input_string~0.base| (store .cse1 (bvadd |main_~#input_string~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet2_11|))) |#memory_int|) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) [2018-11-23 11:27:23,320 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_3, |v_main_#t~nondet2_8|, |v_main_#t~nondet2_11|]. (let ((.cse1 (select |#memory_int| |main_~#input_string~0.base|)) (.cse7 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse0 (= ((_ sign_extend 24) (_ bv97 8)) (select .cse7 |main_~#vogal_array~0.offset|))) (.cse3 (= |main_~#vogal_array~0.offset| (_ bv0 32))) (.cse4 (= (select .cse7 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8)))) (.cse5 (= (_ bv0 32) |main_~#input_string~0.offset|)) (.cse2 (select .cse1 |main_~#input_string~0.offset|)) (.cse6 (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) (or (and .cse0 (= ((_ sign_extend 24) v_prenex_3) (select .cse1 (bvadd |main_~#input_string~0.offset| main_~i~0))) (= .cse2 ((_ sign_extend 24) |v_main_#t~nondet2_8|)) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse3 .cse4 .cse5 (= .cse2 ((_ sign_extend 24) |v_main_#t~nondet2_11|)) .cse6)))) [2018-11-23 11:27:23,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-23 11:27:23,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 11:27:23,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 11:27:23,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:27:23,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:23,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:85 [2018-11-23 11:27:23,617 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:23,618 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, main_~i~0, |v_main_#t~nondet2_12|, |v_main_#t~nondet2_8|]. (let ((.cse0 (select |v_#memory_int_20| |main_~#input_string~0.base|)) (.cse1 (select |v_#memory_int_20| |main_~#vogal_array~0.base|))) (and (= (store |v_#memory_int_20| |main_~#input_string~0.base| (store .cse0 (bvadd |main_~#input_string~0.offset| main_~i~0) ((_ sign_extend 24) |v_main_#t~nondet2_12|))) |#memory_int|) (= (select .cse1 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select .cse0 |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= ((_ sign_extend 24) (_ bv97 8)) (select .cse1 |main_~#vogal_array~0.offset|)) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) [2018-11-23 11:27:23,618 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_4, |v_main_#t~nondet2_8|, |v_main_#t~nondet2_12|]. (let ((.cse2 (select |#memory_int| |main_~#input_string~0.base|)) (.cse7 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse0 (= ((_ sign_extend 24) (_ bv97 8)) (select .cse7 |main_~#vogal_array~0.offset|))) (.cse3 (= |main_~#vogal_array~0.offset| (_ bv0 32))) (.cse4 (= (select .cse7 (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8)))) (.cse1 (select .cse2 |main_~#input_string~0.offset|)) (.cse5 (= (_ bv0 32) |main_~#input_string~0.offset|)) (.cse6 (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))) (or (and .cse0 (= .cse1 ((_ sign_extend 24) |v_main_#t~nondet2_8|)) (= ((_ sign_extend 24) v_prenex_4) (select .cse2 (bvadd |main_~#input_string~0.offset| main_~i~0))) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse3 .cse4 (= .cse1 ((_ sign_extend 24) |v_main_#t~nondet2_12|)) .cse5 .cse6)))) [2018-11-23 11:27:24,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 11:27:24,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 11:27:24,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:24,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:27:24,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:27:24,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:24,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:27:24,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 11:27:24,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:24,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:24,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:27:24,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:39 [2018-11-23 11:27:24,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:27:24,487 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|, main_~i~0, |main_~#vogal_array~0.base|, |v_main_#t~nondet2_8|]. (let ((.cse3 (select |#memory_int| |main_~#input_string~0.base|)) (.cse4 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse0 (select .cse4 (_ bv0 32))) (.cse2 ((_ extract 7 0) (select .cse3 main_~i~0))) (.cse1 (select .cse4 (_ bv1 32)))) (and (= ((_ sign_extend 24) (_ bv97 8)) .cse0) (= .cse1 ((_ sign_extend 24) (_ bv65 8))) (= |main_#t~mem8| .cse2) (= ((_ sign_extend 24) ((_ extract 7 0) .cse0)) ((_ sign_extend 24) .cse2)) (= ((_ extract 7 0) .cse1) |main_#t~mem9|) (= ((_ sign_extend 24) |v_main_#t~nondet2_8|) (select .cse3 (_ bv0 32))) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|))))) [2018-11-23 11:27:24,488 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_15, |v_main_#t~nondet2_8|]. (let ((.cse0 (= |main_#t~mem9| ((_ extract 7 0) ((_ sign_extend 24) (_ bv65 8))))) (.cse2 ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) (_ bv97 8)))))) (or (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_15))) (and .cse0 (= |main_#t~mem8| .cse1) (= .cse2 ((_ sign_extend 24) .cse1)))) (let ((.cse3 ((_ extract 7 0) ((_ sign_extend 24) |v_main_#t~nondet2_8|)))) (and .cse0 (= |main_#t~mem8| .cse3) (= .cse2 ((_ sign_extend 24) .cse3)))))) [2018-11-23 11:27:24,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {10293#true} call ULTIMATE.init(); {10293#true} is VALID [2018-11-23 11:27:24,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {10293#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {10293#true} is VALID [2018-11-23 11:27:24,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {10293#true} assume true; {10293#true} is VALID [2018-11-23 11:27:24,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10293#true} {10293#true} #116#return; {10293#true} is VALID [2018-11-23 11:27:24,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {10293#true} call #t~ret17 := main(); {10293#true} is VALID [2018-11-23 11:27:24,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {10293#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5bv32);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11bv32);call write~init~intINTTYPE1(97bv8, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1bv32);call write~init~intINTTYPE1(65bv8, ~#vogal_array~0.base, ~bvadd32(1bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(101bv8, ~#vogal_array~0.base, ~bvadd32(2bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(69bv8, ~#vogal_array~0.base, ~bvadd32(3bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(105bv8, ~#vogal_array~0.base, ~bvadd32(4bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(73bv8, ~#vogal_array~0.base, ~bvadd32(5bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(111bv8, ~#vogal_array~0.base, ~bvadd32(6bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(79bv8, ~#vogal_array~0.base, ~bvadd32(7bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(117bv8, ~#vogal_array~0.base, ~bvadd32(8bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(85bv8, ~#vogal_array~0.base, ~bvadd32(9bv32, ~#vogal_array~0.offset), 1bv32);call write~init~intINTTYPE1(0bv8, ~#vogal_array~0.base, ~bvadd32(10bv32, ~#vogal_array~0.offset), 1bv32);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0bv32; {10313#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= main_~i~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {10313#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= main_~i~0 (_ bv0 32)) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,580 INFO L273 TraceCheckUtils]: 11: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, 5bv32);call write~intINTTYPE1(#t~nondet2, ~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);havoc #t~nondet2; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !~bvult32(~i~0, 5bv32); {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} call #t~mem3 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(4bv32, ~#input_string~0.offset), 1bv32); {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!(0bv32 == ~sign_extendFrom8To32(#t~mem3));havoc #t~mem3;~n_caracter~0 := 0bv32; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} call #t~mem4 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~n_caracter~0), 1bv32); {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem4));havoc #t~mem4; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} ~cont~0 := 0bv32;~i~0 := 0bv32; {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {10317#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~i~0, ~n_caracter~0);~j~0 := 0bv32; {10372#(and (= main_~j~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {10372#(and (= main_~j~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {10376#(and (= main_~j~0 (_ bv0 32)) (= |main_#t~mem9| ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| main_~j~0)))) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0))) |main_#t~mem8|) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {10376#(and (= main_~j~0 (_ bv0 32)) (= |main_#t~mem9| ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| main_~j~0)))) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0))) |main_#t~mem8|) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {10380#(and (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| main_~j~0))))) (= main_~j~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {10380#(and (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0)))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| main_~j~0))))) (= main_~j~0 (_ bv0 32)) (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= (_ bv0 32) |main_~#input_string~0.offset|) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {10384#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0))))) (= (_ bv0 32) |main_~#input_string~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} is VALID [2018-11-23 11:27:24,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {10384#(and (= ((_ sign_extend 24) (_ bv97 8)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (exists ((|v_main_#t~nondet2_8| (_ BitVec 8))) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) ((_ sign_extend 24) |v_main_#t~nondet2_8|))) (= |main_~#vogal_array~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (bvadd |main_~#vogal_array~0.offset| (_ bv1 32))) ((_ sign_extend 24) (_ bv65 8))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) ((_ sign_extend 24) ((_ extract 7 0) (select (select |#memory_int| |main_~#input_string~0.base|) (bvadd |main_~#input_string~0.offset| main_~i~0))))) (= (_ bv0 32) |main_~#input_string~0.offset|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#input_string~0.base| |main_~#vogal_array~0.base|)))} assume !!~bvult32(~j~0, 2bv32);call #t~mem8 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem9 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {10388#(and (= |main_#t~mem9| ((_ extract 7 0) ((_ sign_extend 24) (_ bv65 8)))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) (_ bv97 8)))) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_15))) (= |main_#t~mem8| ((_ extract 7 0) v_arrayElimCell_15)))))} is VALID [2018-11-23 11:27:24,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {10388#(and (= |main_#t~mem9| ((_ extract 7 0) ((_ sign_extend 24) (_ bv65 8)))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (and (= ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) (_ bv97 8)))) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_15))) (= |main_#t~mem8| ((_ extract 7 0) v_arrayElimCell_15)))))} assume ~sign_extendFrom8To32(#t~mem8) == ~sign_extendFrom8To32(#t~mem9);havoc #t~mem9;havoc #t~mem8;#t~post10 := ~cont~0;~cont~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {10294#false} is VALID [2018-11-23 11:27:24,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {10294#false} #t~post7 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {10294#false} assume !~bvult32(~j~0, 2bv32); {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {10294#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {10294#false} assume !~bvult32(~i~0, ~n_caracter~0); {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {10294#false} ~i~0 := 0bv32;~cont_aux~0 := 0bv32; {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {10294#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {10294#false} assume !!(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11;~j~0 := 0bv32; {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {10294#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {10294#false} is VALID [2018-11-23 11:27:24,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {10294#false} assume ~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14);havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 39: Hoare triple {10294#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {10294#false} assume !!~bvult32(~j~0, 2bv32);call #t~mem13 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32);call #t~mem14 := read~intINTTYPE1(~#vogal_array~0.base, ~bvadd32(~#vogal_array~0.offset, ~j~0), 1bv32); {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {10294#false} assume !(~sign_extendFrom8To32(#t~mem13) == ~sign_extendFrom8To32(#t~mem14));havoc #t~mem13;havoc #t~mem14; {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {10294#false} #t~post12 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {10294#false} assume !~bvult32(~j~0, 2bv32); {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {10294#false} #t~post16 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 45: Hoare triple {10294#false} call #t~mem11 := read~intINTTYPE1(~#input_string~0.base, ~bvadd32(~#input_string~0.offset, ~i~0), 1bv32); {10294#false} is VALID [2018-11-23 11:27:24,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {10294#false} assume !(0bv32 != ~sign_extendFrom8To32(#t~mem11));havoc #t~mem11; {10294#false} is VALID [2018-11-23 11:27:24,639 INFO L256 TraceCheckUtils]: 47: Hoare triple {10294#false} call __VERIFIER_assert((if ~cont_aux~0 == ~cont~0 then 1bv32 else 0bv32)); {10294#false} is VALID [2018-11-23 11:27:24,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {10294#false} ~cond := #in~cond; {10294#false} is VALID [2018-11-23 11:27:24,639 INFO L273 TraceCheckUtils]: 49: Hoare triple {10294#false} assume 0bv32 == ~cond; {10294#false} is VALID [2018-11-23 11:27:24,639 INFO L273 TraceCheckUtils]: 50: Hoare triple {10294#false} assume !false; {10294#false} is VALID [2018-11-23 11:27:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 11:27:24,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:10,399 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 11:28:10,600 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:28:10,601 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-23 11:28:10,606 INFO L168 Benchmark]: Toolchain (without parser) took 91310.09 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:28:10,607 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:28:10,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:28:10,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:28:10,609 INFO L168 Benchmark]: Boogie Preprocessor took 48.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:28:10,609 INFO L168 Benchmark]: RCFGBuilder took 943.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:28:10,610 INFO L168 Benchmark]: TraceAbstraction took 89855.21 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 383.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -370.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:28:10,613 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 425.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 943.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -749.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89855.21 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 383.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -370.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...