/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/vogal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:21:41,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:21:41,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:21:41,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:21:41,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:21:41,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:21:41,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:21:41,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:21:41,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:21:41,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:21:41,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:21:41,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:21:41,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:21:41,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:21:41,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:21:41,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:21:41,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:21:41,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:21:41,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:21:41,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:21:41,332 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:21:41,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:21:41,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:21:41,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:21:41,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:21:41,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:21:41,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:21:41,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:21:41,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:21:41,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:21:41,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:21:41,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:21:41,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:21:41,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:21:41,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:21:41,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:21:41,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:21:41,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:21:41,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:21:41,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:21:41,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:21:41,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:21:41,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:21:41,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:21:41,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:21:41,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:21:41,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:21:41,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:21:41,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:21:41,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:21:41,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:21:41,383 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:21:41,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:21:41,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:21:41,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:21:41,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:41,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:21:41,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:21:41,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:21:41,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:21:41,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:21:41,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:21:41,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:21:41,618 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:21:41,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2022-04-27 10:21:41,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b54f014c/f9718a8d26d44427b40ff1cb809be00d/FLAG8424626a5 [2022-04-27 10:21:41,992 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:21:41,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2022-04-27 10:21:41,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b54f014c/f9718a8d26d44427b40ff1cb809be00d/FLAG8424626a5 [2022-04-27 10:21:42,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b54f014c/f9718a8d26d44427b40ff1cb809be00d [2022-04-27 10:21:42,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:21:42,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:21:42,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:42,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:21:42,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:21:42,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da977e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42, skipping insertion in model container [2022-04-27 10:21:42,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:21:42,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:21:42,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i[895,908] [2022-04-27 10:21:42,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:42,621 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:21:42,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i[895,908] [2022-04-27 10:21:42,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:42,685 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:21:42,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42 WrapperNode [2022-04-27 10:21:42,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:42,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:21:42,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:21:42,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:21:42,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:21:42,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:21:42,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:21:42,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:21:42,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (1/1) ... [2022-04-27 10:21:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:42,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:21:42,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:21:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:21:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:21:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:21:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:21:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:21:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:21:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:21:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 10:21:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:21:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:21:42,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:21:42,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:21:43,112 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:21:43,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:21:43,119 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-27 10:21:43,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:43 BoogieIcfgContainer [2022-04-27 10:21:43,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:21:43,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:21:43,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:21:43,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:21:43,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:21:42" (1/3) ... [2022-04-27 10:21:43,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2807d5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:43, skipping insertion in model container [2022-04-27 10:21:43,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:42" (2/3) ... [2022-04-27 10:21:43,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2807d5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:43, skipping insertion in model container [2022-04-27 10:21:43,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:43" (3/3) ... [2022-04-27 10:21:43,137 INFO L111 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2022-04-27 10:21:43,149 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:21:43,150 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:21:43,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:21:43,196 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61e0599, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d95636c [2022-04-27 10:21:43,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:21:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:21:43,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:43,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:43,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash -366742854, now seen corresponding path program 1 times [2022-04-27 10:21:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:43,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009714124] [2022-04-27 10:21:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:43,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40#true} is VALID [2022-04-27 10:21:43,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 10:21:43,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-27 10:21:43,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:43,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {40#true} is VALID [2022-04-27 10:21:43,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 10:21:43,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-27 10:21:43,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2022-04-27 10:21:43,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {40#true} is VALID [2022-04-27 10:21:43,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~i~0 % 4294967296 < 5); {40#true} is VALID [2022-04-27 10:21:43,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {40#true} is VALID [2022-04-27 10:21:43,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {40#true} is VALID [2022-04-27 10:21:43,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-04-27 10:21:43,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} ~cont~0 := 0;~i~0 := 0; {41#false} is VALID [2022-04-27 10:21:43,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {41#false} is VALID [2022-04-27 10:21:43,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~i~0 := 0;~cont_aux~0 := 0; {41#false} is VALID [2022-04-27 10:21:43,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 10:21:43,489 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-27 10:21:43,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 10:21:43,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 10:21:43,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 10:21:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:43,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009714124] [2022-04-27 10:21:43,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009714124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:43,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:43,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:21:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223846766] [2022-04-27 10:21:43,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:21:43,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:43,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:21:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:21:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:21:43,556 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:43,671 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-27 10:21:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:21:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:21:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 10:21:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 10:21:43,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 10:21:43,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:43,824 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:21:43,824 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:21:43,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:21:43,834 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:43,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:21:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:21:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 10:21:43,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:43,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,864 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,866 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:43,871 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-27 10:21:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-27 10:21:43,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:43,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:43,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 10:21:43,873 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-27 10:21:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:43,876 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-27 10:21:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-27 10:21:43,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:43,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:43,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:43,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-27 10:21:43,890 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2022-04-27 10:21:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-27 10:21:43,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-27 10:21:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:21:43,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:43,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:43,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:21:43,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -864138192, now seen corresponding path program 1 times [2022-04-27 10:21:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358964211] [2022-04-27 10:21:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:43,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {235#true} is VALID [2022-04-27 10:21:43,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} assume true; {235#true} is VALID [2022-04-27 10:21:43,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {235#true} {235#true} #133#return; {235#true} is VALID [2022-04-27 10:21:44,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:44,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {235#true} is VALID [2022-04-27 10:21:44,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} assume true; {235#true} is VALID [2022-04-27 10:21:44,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#true} {235#true} #133#return; {235#true} is VALID [2022-04-27 10:21:44,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#true} call #t~ret17 := main(); {235#true} is VALID [2022-04-27 10:21:44,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {240#(= main_~i~0 0)} is VALID [2022-04-27 10:21:44,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 5); {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#false} assume !(0 != #t~mem4);havoc #t~mem4; {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#false} ~cont~0 := 0;~i~0 := 0; {236#false} is VALID [2022-04-27 10:21:44,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {236#false} is VALID [2022-04-27 10:21:44,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {236#false} ~i~0 := 0;~cont_aux~0 := 0; {236#false} is VALID [2022-04-27 10:21:44,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {236#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {236#false} is VALID [2022-04-27 10:21:44,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {236#false} assume !(0 != #t~mem11);havoc #t~mem11; {236#false} is VALID [2022-04-27 10:21:44,006 INFO L272 TraceCheckUtils]: 16: Hoare triple {236#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {236#false} is VALID [2022-04-27 10:21:44,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2022-04-27 10:21:44,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2022-04-27 10:21:44,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-04-27 10:21:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:44,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358964211] [2022-04-27 10:21:44,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358964211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:44,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:44,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:21:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389857736] [2022-04-27 10:21:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:21:44,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:44,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:44,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:21:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:21:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:21:44,031 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:44,192 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-27 10:21:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:21:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:21:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 10:21:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 10:21:44,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-27 10:21:44,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:44,284 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:21:44,284 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 10:21:44,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:21:44,290 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:44,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 10:21:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-27 10:21:44,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:44,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,300 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,300 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:44,309 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-27 10:21:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-27 10:21:44,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:44,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:44,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 10:21:44,311 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 10:21:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:44,317 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-27 10:21:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-27 10:21:44,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:44,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:44,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:44,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-27 10:21:44,324 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2022-04-27 10:21:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:44,325 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-27 10:21:44,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 10:21:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:21:44,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:44,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:44,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:21:44,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash 32041234, now seen corresponding path program 1 times [2022-04-27 10:21:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:44,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050290427] [2022-04-27 10:21:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:44,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {472#true} is VALID [2022-04-27 10:21:44,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#true} assume true; {472#true} is VALID [2022-04-27 10:21:44,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {472#true} {472#true} #133#return; {472#true} is VALID [2022-04-27 10:21:44,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:44,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {472#true} is VALID [2022-04-27 10:21:44,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2022-04-27 10:21:44,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #133#return; {472#true} is VALID [2022-04-27 10:21:44,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret17 := main(); {472#true} is VALID [2022-04-27 10:21:44,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {477#(= main_~i~0 0)} is VALID [2022-04-27 10:21:44,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {477#(= main_~i~0 0)} is VALID [2022-04-27 10:21:44,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {478#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {473#false} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {473#false} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {473#false} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {473#false} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {473#false} assume !(0 != #t~mem4);havoc #t~mem4; {473#false} is VALID [2022-04-27 10:21:44,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {473#false} ~cont~0 := 0;~i~0 := 0; {473#false} is VALID [2022-04-27 10:21:44,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {473#false} is VALID [2022-04-27 10:21:44,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#false} ~i~0 := 0;~cont_aux~0 := 0; {473#false} is VALID [2022-04-27 10:21:44,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {473#false} is VALID [2022-04-27 10:21:44,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {473#false} assume !(0 != #t~mem11);havoc #t~mem11; {473#false} is VALID [2022-04-27 10:21:44,488 INFO L272 TraceCheckUtils]: 18: Hoare triple {473#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {473#false} is VALID [2022-04-27 10:21:44,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2022-04-27 10:21:44,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2022-04-27 10:21:44,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {473#false} assume !false; {473#false} is VALID [2022-04-27 10:21:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:44,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050290427] [2022-04-27 10:21:44,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050290427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:44,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536482246] [2022-04-27 10:21:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:44,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:44,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:44,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:21:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:44,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:21:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:44,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:44,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2022-04-27 10:21:44,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {472#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {472#true} is VALID [2022-04-27 10:21:44,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2022-04-27 10:21:44,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #133#return; {472#true} is VALID [2022-04-27 10:21:44,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret17 := main(); {472#true} is VALID [2022-04-27 10:21:44,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {472#true} is VALID [2022-04-27 10:21:44,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {472#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {472#true} is VALID [2022-04-27 10:21:44,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {472#true} is VALID [2022-04-27 10:21:44,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#true} assume !(~i~0 % 4294967296 < 5); {472#true} is VALID [2022-04-27 10:21:44,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {472#true} is VALID [2022-04-27 10:21:44,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {472#true} is VALID [2022-04-27 10:21:44,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {472#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {472#true} is VALID [2022-04-27 10:21:44,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#true} assume !(0 != #t~mem4);havoc #t~mem4; {472#true} is VALID [2022-04-27 10:21:44,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#true} ~cont~0 := 0;~i~0 := 0; {522#(= main_~cont~0 0)} is VALID [2022-04-27 10:21:44,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(= main_~cont~0 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {522#(= main_~cont~0 0)} is VALID [2022-04-27 10:21:44,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {522#(= main_~cont~0 0)} ~i~0 := 0;~cont_aux~0 := 0; {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-27 10:21:44,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-27 10:21:44,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} assume !(0 != #t~mem11);havoc #t~mem11; {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-27 10:21:44,774 INFO L272 TraceCheckUtils]: 18: Hoare triple {529#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {539#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:44,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {539#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {543#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:44,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {543#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {473#false} is VALID [2022-04-27 10:21:44,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {473#false} assume !false; {473#false} is VALID [2022-04-27 10:21:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:21:44,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:21:44,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536482246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:44,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:21:44,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-27 10:21:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088129763] [2022-04-27 10:21:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:21:44,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:44,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:44,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:21:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:21:44,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:21:44,805 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:44,969 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 10:21:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:21:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:21:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 10:21:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 10:21:44,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-27 10:21:45,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:45,036 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:21:45,036 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 10:21:45,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:21:45,037 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 171 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:21:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 10:21:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2022-04-27 10:21:45,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:45,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,042 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,042 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:45,049 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 10:21:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-27 10:21:45,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:45,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:45,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-27 10:21:45,052 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-27 10:21:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:45,054 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-27 10:21:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-27 10:21:45,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:45,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:45,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:45,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-27 10:21:45,056 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 22 [2022-04-27 10:21:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:45,056 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-04-27 10:21:45,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-04-27 10:21:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:21:45,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:45,057 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-27 10:21:45,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:45,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:45,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:45,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1521854123, now seen corresponding path program 1 times [2022-04-27 10:21:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:45,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981426262] [2022-04-27 10:21:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:45,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {788#true} is VALID [2022-04-27 10:21:45,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-27 10:21:45,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #133#return; {788#true} is VALID [2022-04-27 10:21:45,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:45,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {788#true} is VALID [2022-04-27 10:21:45,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-27 10:21:45,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #133#return; {788#true} is VALID [2022-04-27 10:21:45,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret17 := main(); {788#true} is VALID [2022-04-27 10:21:45,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {793#(= main_~i~0 0)} is VALID [2022-04-27 10:21:45,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {793#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {793#(= main_~i~0 0)} is VALID [2022-04-27 10:21:45,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {794#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:21:45,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {789#false} is VALID [2022-04-27 10:21:45,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {789#false} is VALID [2022-04-27 10:21:45,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#false} assume !(0 != #t~mem4);havoc #t~mem4; {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#false} ~cont~0 := 0;~i~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {789#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {789#false} is VALID [2022-04-27 10:21:45,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#false} assume !(~j~0 % 4294967296 < 2); {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} ~i~0 := 0;~cont_aux~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {789#false} is VALID [2022-04-27 10:21:45,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {789#false} assume !(0 != #t~mem11);havoc #t~mem11; {789#false} is VALID [2022-04-27 10:21:45,363 INFO L272 TraceCheckUtils]: 24: Hoare triple {789#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {789#false} is VALID [2022-04-27 10:21:45,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-04-27 10:21:45,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {789#false} assume 0 == ~cond; {789#false} is VALID [2022-04-27 10:21:45,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-27 10:21:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:21:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981426262] [2022-04-27 10:21:45,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981426262] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:45,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979252959] [2022-04-27 10:21:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:45,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:45,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:45,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:45,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:21:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:45,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:21:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:45,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:45,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2022-04-27 10:21:45,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {788#true} is VALID [2022-04-27 10:21:45,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-27 10:21:45,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #133#return; {788#true} is VALID [2022-04-27 10:21:45,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret17 := main(); {788#true} is VALID [2022-04-27 10:21:45,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {788#true} is VALID [2022-04-27 10:21:45,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {788#true} is VALID [2022-04-27 10:21:45,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {788#true} is VALID [2022-04-27 10:21:45,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#true} assume !(~i~0 % 4294967296 < 5); {788#true} is VALID [2022-04-27 10:21:45,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {788#true} is VALID [2022-04-27 10:21:45,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {829#(= main_~n_caracter~0 0)} is VALID [2022-04-27 10:21:45,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {829#(= main_~n_caracter~0 0)} is VALID [2022-04-27 10:21:45,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#(= main_~n_caracter~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {829#(= main_~n_caracter~0 0)} is VALID [2022-04-27 10:21:45,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#(= main_~n_caracter~0 0)} ~cont~0 := 0;~i~0 := 0; {839#(and (= main_~n_caracter~0 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {839#(and (= main_~n_caracter~0 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {789#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {789#false} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {789#false} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {789#false} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#false} assume !(~j~0 % 4294967296 < 2); {789#false} is VALID [2022-04-27 10:21:45,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#false} ~i~0 := 0;~cont_aux~0 := 0; {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {789#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {789#false} assume !(0 != #t~mem11);havoc #t~mem11; {789#false} is VALID [2022-04-27 10:21:45,542 INFO L272 TraceCheckUtils]: 24: Hoare triple {789#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {789#false} assume 0 == ~cond; {789#false} is VALID [2022-04-27 10:21:45,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-27 10:21:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:21:45,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:21:45,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979252959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:45,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:21:45,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-27 10:21:45,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205952514] [2022-04-27 10:21:45,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:45,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:21:45,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:45,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:21:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:21:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:21:45,565 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:45,680 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-27 10:21:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:21:45,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:21:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-27 10:21:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-27 10:21:45,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-27 10:21:45,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:45,746 INFO L225 Difference]: With dead ends: 100 [2022-04-27 10:21:45,746 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 10:21:45,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:21:45,747 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:45,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 88 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:21:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 10:21:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2022-04-27 10:21:45,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:45,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,754 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,754 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:45,756 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-27 10:21:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-27 10:21:45,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:45,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:45,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-27 10:21:45,757 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-27 10:21:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:45,759 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-27 10:21:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-27 10:21:45,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:45,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:45,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:45,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-04-27 10:21:45,762 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 28 [2022-04-27 10:21:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:45,762 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-04-27 10:21:45,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-04-27 10:21:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:21:45,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:45,763 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 10:21:45,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:45,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:21:45,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2104041838, now seen corresponding path program 1 times [2022-04-27 10:21:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:45,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544878891] [2022-04-27 10:21:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:46,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1226#true} is VALID [2022-04-27 10:21:46,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-27 10:21:46,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1226#true} {1226#true} #133#return; {1226#true} is VALID [2022-04-27 10:21:46,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:46,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1226#true} is VALID [2022-04-27 10:21:46,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-27 10:21:46,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #133#return; {1226#true} is VALID [2022-04-27 10:21:46,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret17 := main(); {1226#true} is VALID [2022-04-27 10:21:46,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1231#(= main_~i~0 0)} is VALID [2022-04-27 10:21:46,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1231#(= main_~i~0 0)} is VALID [2022-04-27 10:21:46,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1232#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1232#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {1227#false} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1227#false} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1227#false} assume !(0 != #t~mem4);havoc #t~mem4; {1227#false} is VALID [2022-04-27 10:21:46,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {1227#false} ~cont~0 := 0;~i~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1227#false} is VALID [2022-04-27 10:21:46,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#false} ~i~0 := 0;~cont_aux~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1227#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1227#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {1227#false} is VALID [2022-04-27 10:21:46,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1227#false} is VALID [2022-04-27 10:21:46,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#false} assume !(~j~0 % 4294967296 < 2); {1227#false} is VALID [2022-04-27 10:21:46,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {1227#false} assume !(0 != #t~mem11);havoc #t~mem11; {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L272 TraceCheckUtils]: 25: Hoare triple {1227#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2022-04-27 10:21:46,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-27 10:21:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:21:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544878891] [2022-04-27 10:21:46,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544878891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163326553] [2022-04-27 10:21:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:46,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:46,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:21:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:46,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 10:21:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:46,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:46,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-04-27 10:21:46,424 INFO L390 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 15 treesize of output 7 [2022-04-27 10:21:46,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2022-04-27 10:21:46,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1226#true} is VALID [2022-04-27 10:21:46,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-27 10:21:46,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #133#return; {1226#true} is VALID [2022-04-27 10:21:46,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret17 := main(); {1226#true} is VALID [2022-04-27 10:21:46,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1252#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:46,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1256#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:46,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1256#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1256#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:46,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1256#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {1256#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:46,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1256#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1256#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:46,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {1256#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1269#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:46,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1273#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem4|))} is VALID [2022-04-27 10:21:46,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {1273#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem4|))} assume !(0 != #t~mem4);havoc #t~mem4; {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:46,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:46,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:46,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {1277#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {1287#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:46,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1291#(= |main_#t~mem11| 0)} is VALID [2022-04-27 10:21:46,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1291#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {1227#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {1227#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#false} assume !(~j~0 % 4294967296 < 2); {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {1227#false} assume !(0 != #t~mem11);havoc #t~mem11; {1227#false} is VALID [2022-04-27 10:21:46,466 INFO L272 TraceCheckUtils]: 25: Hoare triple {1227#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1227#false} is VALID [2022-04-27 10:21:46,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2022-04-27 10:21:46,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2022-04-27 10:21:46,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-27 10:21:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:21:46,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:46,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-27 10:21:46,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2022-04-27 10:21:46,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2022-04-27 10:21:46,684 INFO L272 TraceCheckUtils]: 25: Hoare triple {1227#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1227#false} is VALID [2022-04-27 10:21:46,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1227#false} assume !(0 != #t~mem11);havoc #t~mem11; {1227#false} is VALID [2022-04-27 10:21:46,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#false} assume !(~j~0 % 4294967296 < 2); {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {1227#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1227#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1227#false} is VALID [2022-04-27 10:21:46,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1291#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1227#false} is VALID [2022-04-27 10:21:46,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {1364#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0) (not (<= (mod main_~i~0 4294967296) 2147483647))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1291#(= |main_#t~mem11| 0)} is VALID [2022-04-27 10:21:46,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} ~i~0 := 0;~cont_aux~0 := 0; {1364#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0) (not (<= (mod main_~i~0 4294967296) 2147483647))))} is VALID [2022-04-27 10:21:46,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-27 10:21:46,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} ~cont~0 := 0;~i~0 := 0; {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-27 10:21:46,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1378#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= |main_#t~mem4| 0)))} assume !(0 != #t~mem4);havoc #t~mem4; {1368#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-27 10:21:46,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {1382#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (and (or (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0)) (<= (mod main_~n_caracter~0 4294967296) 2147483647))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1378#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= |main_#t~mem4| 0)))} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1382#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (and (or (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0)) (<= (mod main_~n_caracter~0 4294967296) 2147483647))))} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1226#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1226#true} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1226#true} assume !(~i~0 % 4294967296 < 5); {1226#true} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1226#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1226#true} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1226#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1226#true} is VALID [2022-04-27 10:21:46,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1226#true} is VALID [2022-04-27 10:21:46,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret17 := main(); {1226#true} is VALID [2022-04-27 10:21:46,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #133#return; {1226#true} is VALID [2022-04-27 10:21:46,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-27 10:21:46,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1226#true} is VALID [2022-04-27 10:21:46,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2022-04-27 10:21:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:21:46,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163326553] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:46,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:21:46,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-27 10:21:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867877883] [2022-04-27 10:21:46,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:46,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 10:21:46,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:46,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:46,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:46,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:21:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:21:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:21:46,717 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:47,008 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-27 10:21:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:21:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 10:21:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:21:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:21:47,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-27 10:21:47,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:47,061 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:21:47,061 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 10:21:47,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:21:47,063 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:47,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 10:21:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 10:21:47,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:47,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,068 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,068 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:47,070 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-27 10:21:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-27 10:21:47,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:47,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:47,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 10:21:47,070 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 10:21:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:47,072 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-27 10:21:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-27 10:21:47,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:47,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:47,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:47,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-27 10:21:47,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 29 [2022-04-27 10:21:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:47,074 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-27 10:21:47,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-27 10:21:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:21:47,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:47,074 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-27 10:21:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:47,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 130872262, now seen corresponding path program 1 times [2022-04-27 10:21:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:47,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196957221] [2022-04-27 10:21:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:47,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1670#true} is VALID [2022-04-27 10:21:47,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-27 10:21:47,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1670#true} {1670#true} #133#return; {1670#true} is VALID [2022-04-27 10:21:47,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:47,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1670#true} is VALID [2022-04-27 10:21:47,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-27 10:21:47,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #133#return; {1670#true} is VALID [2022-04-27 10:21:47,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret17 := main(); {1670#true} is VALID [2022-04-27 10:21:47,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1675#(= main_~i~0 0)} is VALID [2022-04-27 10:21:47,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {1675#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1675#(= main_~i~0 0)} is VALID [2022-04-27 10:21:47,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1675#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1676#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:21:47,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {1671#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#false} assume !(0 != #t~mem4);havoc #t~mem4; {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {1671#false} ~cont~0 := 0;~i~0 := 0; {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {1671#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {1671#false} is VALID [2022-04-27 10:21:47,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {1671#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1671#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {1671#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1671#false} assume !(~j~0 % 4294967296 < 2); {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1671#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {1671#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {1671#false} ~i~0 := 0;~cont_aux~0 := 0; {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1671#false} assume !(0 != #t~mem11);havoc #t~mem11; {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L272 TraceCheckUtils]: 26: Hoare triple {1671#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1671#false} is VALID [2022-04-27 10:21:47,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {1671#false} ~cond := #in~cond; {1671#false} is VALID [2022-04-27 10:21:47,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#false} assume 0 == ~cond; {1671#false} is VALID [2022-04-27 10:21:47,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2022-04-27 10:21:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:21:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196957221] [2022-04-27 10:21:47,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196957221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802328150] [2022-04-27 10:21:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:47,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:47,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:21:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:47,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:21:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:47,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:47,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-04-27 10:21:47,651 INFO L390 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 16 treesize of output 8 [2022-04-27 10:21:47,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2022-04-27 10:21:47,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1670#true} is VALID [2022-04-27 10:21:47,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-27 10:21:47,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #133#return; {1670#true} is VALID [2022-04-27 10:21:47,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret17 := main(); {1670#true} is VALID [2022-04-27 10:21:47,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1696#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:47,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {1696#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1700#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:47,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1700#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1700#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:47,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {1700#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {1700#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:47,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1700#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:47,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1713#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {1713#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1717#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem4|))} is VALID [2022-04-27 10:21:47,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {1717#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem4|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:47,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {1721#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {1755#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:47,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {1755#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1759#(not (= |main_#t~mem11| 0))} is VALID [2022-04-27 10:21:47,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {1759#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {1671#false} is VALID [2022-04-27 10:21:47,675 INFO L272 TraceCheckUtils]: 26: Hoare triple {1671#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1671#false} is VALID [2022-04-27 10:21:47,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {1671#false} ~cond := #in~cond; {1671#false} is VALID [2022-04-27 10:21:47,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#false} assume 0 == ~cond; {1671#false} is VALID [2022-04-27 10:21:47,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2022-04-27 10:21:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:21:47,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:47,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2022-04-27 10:21:47,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#false} assume 0 == ~cond; {1671#false} is VALID [2022-04-27 10:21:47,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {1671#false} ~cond := #in~cond; {1671#false} is VALID [2022-04-27 10:21:47,917 INFO L272 TraceCheckUtils]: 26: Hoare triple {1671#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1671#false} is VALID [2022-04-27 10:21:47,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {1759#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {1671#false} is VALID [2022-04-27 10:21:47,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#(and (or (<= (mod main_~i~0 4294967296) 2147483647) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0))) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1759#(not (= |main_#t~mem11| 0))} is VALID [2022-04-27 10:21:47,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} ~i~0 := 0;~cont_aux~0 := 0; {1790#(and (or (<= (mod main_~i~0 4294967296) 2147483647) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0))) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0))))} is VALID [2022-04-27 10:21:47,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(~j~0 % 4294967296 < 2); {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} ~cont~0 := 0;~i~0 := 0; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_#t~mem4| 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {1794#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-27 10:21:47,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {1832#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (and (or (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (<= (mod main_~n_caracter~0 4294967296) 2147483647))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1828#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1832#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (and (or (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (<= (mod main_~n_caracter~0 4294967296) 2147483647))))} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#true} assume !(~i~0 % 4294967296 < 5); {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1670#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {1670#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1670#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret17 := main(); {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #133#return; {1670#true} is VALID [2022-04-27 10:21:47,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2022-04-27 10:21:47,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1670#true} is VALID [2022-04-27 10:21:47,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2022-04-27 10:21:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 10:21:47,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802328150] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:47,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:21:47,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-27 10:21:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736419180] [2022-04-27 10:21:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:21:47,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:47,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:47,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:47,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:21:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:21:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:21:47,956 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:48,250 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-04-27 10:21:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:21:48,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:21:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 10:21:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-27 10:21:48,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-27 10:21:48,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:48,311 INFO L225 Difference]: With dead ends: 72 [2022-04-27 10:21:48,311 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:21:48,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:21:48,312 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 101 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:48,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 94 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:21:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-27 10:21:48,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:48,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,326 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,326 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:48,328 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-27 10:21:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-27 10:21:48,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:48,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:48,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 10:21:48,328 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 10:21:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:48,330 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-27 10:21:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-27 10:21:48,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:48,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:48,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:48,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-04-27 10:21:48,332 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2022-04-27 10:21:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:48,333 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-04-27 10:21:48,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-27 10:21:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:21:48,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:48,333 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 10:21:48,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:48,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:48,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1933277107, now seen corresponding path program 1 times [2022-04-27 10:21:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:48,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249558628] [2022-04-27 10:21:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:48,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {2180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2173#true} is VALID [2022-04-27 10:21:48,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-27 10:21:48,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2173#true} {2173#true} #133#return; {2173#true} is VALID [2022-04-27 10:21:48,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:48,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2173#true} is VALID [2022-04-27 10:21:48,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-27 10:21:48,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #133#return; {2173#true} is VALID [2022-04-27 10:21:48,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret17 := main(); {2173#true} is VALID [2022-04-27 10:21:48,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2178#(= main_~i~0 0)} is VALID [2022-04-27 10:21:48,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {2178#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2178#(= main_~i~0 0)} is VALID [2022-04-27 10:21:48,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {2178#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2179#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:21:48,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {2179#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {2174#false} is VALID [2022-04-27 10:21:48,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {2174#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2174#false} is VALID [2022-04-27 10:21:48,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {2174#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {2174#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {2174#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {2174#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {2174#false} assume !(0 != #t~mem4);havoc #t~mem4; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {2174#false} ~cont~0 := 0;~i~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {2174#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {2174#false} ~i~0 := 0;~cont_aux~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {2174#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {2174#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {2174#false} is VALID [2022-04-27 10:21:48,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {2174#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !(~j~0 % 4294967296 < 2); {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {2174#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {2174#false} assume !(0 != #t~mem11);havoc #t~mem11; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L272 TraceCheckUtils]: 27: Hoare triple {2174#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-27 10:21:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:21:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249558628] [2022-04-27 10:21:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249558628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624645986] [2022-04-27 10:21:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:48,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:48,630 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:48,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:21:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:48,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 10:21:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:48,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:48,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-27 10:21:48,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2173#true} is VALID [2022-04-27 10:21:48,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-27 10:21:48,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #133#return; {2173#true} is VALID [2022-04-27 10:21:48,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret17 := main(); {2173#true} is VALID [2022-04-27 10:21:48,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2178#(= main_~i~0 0)} is VALID [2022-04-27 10:21:48,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2178#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2178#(= main_~i~0 0)} is VALID [2022-04-27 10:21:48,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {2178#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2205#(= main_~i~0 1)} is VALID [2022-04-27 10:21:48,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 5); {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {2174#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {2174#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2174#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {2174#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {2174#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2174#false} assume !(0 != #t~mem4);havoc #t~mem4; {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {2174#false} ~cont~0 := 0;~i~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2174#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {2174#false} ~i~0 := 0;~cont_aux~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {2174#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {2174#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {2174#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !(~j~0 % 4294967296 < 2); {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {2174#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {2174#false} assume !(0 != #t~mem11);havoc #t~mem11; {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L272 TraceCheckUtils]: 27: Hoare triple {2174#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2174#false} is VALID [2022-04-27 10:21:48,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-27 10:21:48,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-27 10:21:48,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-27 10:21:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 10:21:48,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:48,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-27 10:21:48,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L272 TraceCheckUtils]: 27: Hoare triple {2174#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {2174#false} assume !(0 != #t~mem11);havoc #t~mem11; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {2174#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !(~j~0 % 4294967296 < 2); {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {2174#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {2174#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {2174#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {2174#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2174#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2174#false} is VALID [2022-04-27 10:21:48,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {2174#false} ~i~0 := 0;~cont_aux~0 := 0; {2174#false} is VALID [2022-04-27 10:21:48,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {2317#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2174#false} is VALID [2022-04-27 10:21:48,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {2317#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:48,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {2321#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {2321#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:48,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2321#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:48,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {2331#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2321#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:48,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2331#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2331#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-27 10:21:48,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {2173#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2331#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-27 10:21:48,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#true} assume !(~i~0 % 4294967296 < 5); {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {2173#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret17 := main(); {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #133#return; {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-27 10:21:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:21:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624645986] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:48,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:48,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-04-27 10:21:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467688497] [2022-04-27 10:21:48,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:48,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:21:48,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:48,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:48,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:48,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 10:21:48,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 10:21:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:21:48,934 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:49,839 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2022-04-27 10:21:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 10:21:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:21:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2022-04-27 10:21:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2022-04-27 10:21:49,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 170 transitions. [2022-04-27 10:21:50,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:50,020 INFO L225 Difference]: With dead ends: 211 [2022-04-27 10:21:50,020 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 10:21:50,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:21:50,021 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 290 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:50,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 70 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:21:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 10:21:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 53. [2022-04-27 10:21:50,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:50,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,045 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,046 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:50,050 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2022-04-27 10:21:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-04-27 10:21:50,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:50,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:50,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-27 10:21:50,052 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 173 states. [2022-04-27 10:21:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:50,056 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2022-04-27 10:21:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-04-27 10:21:50,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:50,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:50,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:50,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-04-27 10:21:50,059 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 31 [2022-04-27 10:21:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:50,059 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-04-27 10:21:50,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-04-27 10:21:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 10:21:50,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:50,060 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-27 10:21:50,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:50,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:50,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:50,276 INFO L85 PathProgramCache]: Analyzing trace with hash 827339542, now seen corresponding path program 2 times [2022-04-27 10:21:50,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:50,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016401877] [2022-04-27 10:21:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:50,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:50,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {3114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3106#true} is VALID [2022-04-27 10:21:50,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-27 10:21:50,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3106#true} {3106#true} #133#return; {3106#true} is VALID [2022-04-27 10:21:50,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:50,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3106#true} is VALID [2022-04-27 10:21:50,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-27 10:21:50,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #133#return; {3106#true} is VALID [2022-04-27 10:21:50,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret17 := main(); {3106#true} is VALID [2022-04-27 10:21:50,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3111#(= main_~i~0 0)} is VALID [2022-04-27 10:21:50,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {3111#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3111#(= main_~i~0 0)} is VALID [2022-04-27 10:21:50,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:50,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:50,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3113#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:50,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {3113#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 5); {3107#false} is VALID [2022-04-27 10:21:50,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3107#false} is VALID [2022-04-27 10:21:50,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {3107#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {3107#false} assume !(0 != #t~mem4);havoc #t~mem4; {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {3107#false} ~cont~0 := 0;~i~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {3107#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {3107#false} ~i~0 := 0;~cont_aux~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {3107#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {3107#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {3107#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {3107#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {3107#false} assume !(~j~0 % 4294967296 < 2); {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {3107#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {3107#false} assume !(0 != #t~mem11);havoc #t~mem11; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L272 TraceCheckUtils]: 31: Hoare triple {3107#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-27 10:21:50,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-27 10:21:50,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-27 10:21:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:21:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:50,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016401877] [2022-04-27 10:21:50,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016401877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:50,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614978102] [2022-04-27 10:21:50,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:21:50,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:50,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:50,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:50,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 10:21:50,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:21:50,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:21:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 10:21:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:50,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:50,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3106#true} is VALID [2022-04-27 10:21:50,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3106#true} is VALID [2022-04-27 10:21:50,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-27 10:21:50,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #133#return; {3106#true} is VALID [2022-04-27 10:21:50,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret17 := main(); {3106#true} is VALID [2022-04-27 10:21:50,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3111#(= main_~i~0 0)} is VALID [2022-04-27 10:21:50,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {3111#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3111#(= main_~i~0 0)} is VALID [2022-04-27 10:21:50,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:50,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:50,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {3112#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3145#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:50,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {3145#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 5); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {3107#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {3107#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {3107#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {3107#false} assume !(0 != #t~mem4);havoc #t~mem4; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {3107#false} ~cont~0 := 0;~i~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {3107#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {3107#false} ~i~0 := 0;~cont_aux~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {3107#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {3107#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {3107#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {3107#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {3107#false} assume !(~j~0 % 4294967296 < 2); {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {3107#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {3107#false} assume !(0 != #t~mem11);havoc #t~mem11; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L272 TraceCheckUtils]: 31: Hoare triple {3107#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-27 10:21:50,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-27 10:21:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:21:50,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:50,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-27 10:21:50,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-27 10:21:50,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-27 10:21:50,860 INFO L272 TraceCheckUtils]: 31: Hoare triple {3107#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-27 10:21:50,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {3107#false} assume !(0 != #t~mem11);havoc #t~mem11; {3107#false} is VALID [2022-04-27 10:21:50,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {3107#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {3107#false} assume !(~j~0 % 4294967296 < 2); {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {3107#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {3107#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {3107#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {3107#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {3107#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3107#false} is VALID [2022-04-27 10:21:50,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {3107#false} ~i~0 := 0;~cont_aux~0 := 0; {3107#false} is VALID [2022-04-27 10:21:50,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {3263#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3107#false} is VALID [2022-04-27 10:21:50,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {3267#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {3263#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:50,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {3267#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {3267#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:50,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {3267#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3267#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:50,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {3277#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3267#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-27 10:21:50,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {3277#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3277#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-27 10:21:50,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {3284#(< 0 (mod (+ main_~n_caracter~0 2) 4294967296))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3277#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-27 10:21:50,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3284#(< 0 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3284#(< 0 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-27 10:21:50,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {3106#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3284#(< 0 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-27 10:21:50,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {3106#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3106#true} is VALID [2022-04-27 10:21:50,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#true} assume !(~i~0 % 4294967296 < 5); {3106#true} is VALID [2022-04-27 10:21:50,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {3106#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#true} is VALID [2022-04-27 10:21:50,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {3106#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {3106#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret17 := main(); {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #133#return; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3106#true} is VALID [2022-04-27 10:21:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 10:21:50,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614978102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:50,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:50,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 10:21:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397887386] [2022-04-27 10:21:50,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 10:21:50,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:50,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:50,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:50,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:21:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:21:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:21:50,915 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:53,027 INFO L93 Difference]: Finished difference Result 363 states and 501 transitions. [2022-04-27 10:21:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 10:21:53,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 10:21:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 285 transitions. [2022-04-27 10:21:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 285 transitions. [2022-04-27 10:21:53,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 285 transitions. [2022-04-27 10:21:53,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:53,299 INFO L225 Difference]: With dead ends: 363 [2022-04-27 10:21:53,299 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 10:21:53,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 10:21:53,300 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 764 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:53,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 85 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:21:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 10:21:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 57. [2022-04-27 10:21:53,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:53,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,349 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,349 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:53,358 INFO L93 Difference]: Finished difference Result 321 states and 445 transitions. [2022-04-27 10:21:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 445 transitions. [2022-04-27 10:21:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:53,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:53,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 10:21:53,360 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 321 states. [2022-04-27 10:21:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:53,369 INFO L93 Difference]: Finished difference Result 321 states and 445 transitions. [2022-04-27 10:21:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 445 transitions. [2022-04-27 10:21:53,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:53,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:53,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:53,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-27 10:21:53,371 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 35 [2022-04-27 10:21:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:53,372 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-04-27 10:21:53,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-04-27 10:21:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:21:53,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:53,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2022-04-27 10:21:53,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:53,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:53,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash 564811463, now seen corresponding path program 1 times [2022-04-27 10:21:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:53,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700892354] [2022-04-27 10:21:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:53,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {4609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4600#true} is VALID [2022-04-27 10:21:53,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-27 10:21:53,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4600#true} {4600#true} #133#return; {4600#true} is VALID [2022-04-27 10:21:53,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:53,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {4609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4600#true} is VALID [2022-04-27 10:21:53,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-27 10:21:53,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4600#true} {4600#true} #133#return; {4600#true} is VALID [2022-04-27 10:21:53,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {4600#true} call #t~ret17 := main(); {4600#true} is VALID [2022-04-27 10:21:53,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {4605#(= main_~i~0 0)} is VALID [2022-04-27 10:21:53,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {4605#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4605#(= main_~i~0 0)} is VALID [2022-04-27 10:21:53,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {4605#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4606#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:53,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {4606#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4606#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:53,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {4606#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4607#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:53,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {4607#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4607#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:53,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {4607#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4608#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-27 10:21:53,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {4608#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 5); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {4601#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {4601#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {4601#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {4601#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {4601#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {4601#false} assume !(0 != #t~mem4);havoc #t~mem4; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {4601#false} ~cont~0 := 0;~i~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {4601#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {4601#false} assume !(~j~0 % 4294967296 < 2); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {4601#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {4601#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {4601#false} ~i~0 := 0;~cont_aux~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {4601#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {4601#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {4601#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {4601#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {4601#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {4601#false} assume !(~j~0 % 4294967296 < 2); {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {4601#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {4601#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {4601#false} assume !(0 != #t~mem11);havoc #t~mem11; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L272 TraceCheckUtils]: 34: Hoare triple {4601#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2022-04-27 10:21:53,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2022-04-27 10:21:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:21:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700892354] [2022-04-27 10:21:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700892354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761738179] [2022-04-27 10:21:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:53,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:53,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:53,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 10:21:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:53,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:21:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:53,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:53,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {4600#true} call ULTIMATE.init(); {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4600#true} assume true; {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4600#true} {4600#true} #133#return; {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {4600#true} call #t~ret17 := main(); {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4600#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4600#true} is VALID [2022-04-27 10:21:53,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {4600#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {4600#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {4600#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {4600#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {4600#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {4600#true} assume !(~i~0 % 4294967296 < 5); {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {4600#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {4600#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {4600#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {4600#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {4600#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {4600#true} assume !(0 != #t~mem4);havoc #t~mem4; {4600#true} is VALID [2022-04-27 10:21:53,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {4600#true} ~cont~0 := 0;~i~0 := 0; {4600#true} is VALID [2022-04-27 10:21:53,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {4600#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {4673#(= main_~j~0 0)} is VALID [2022-04-27 10:21:53,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {4673#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < 2); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {4601#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {4601#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {4601#false} ~i~0 := 0;~cont_aux~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {4601#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {4601#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {4601#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {4601#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {4601#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {4601#false} assume !(~j~0 % 4294967296 < 2); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {4601#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {4601#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4601#false} is VALID [2022-04-27 10:21:53,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {4601#false} assume !(0 != #t~mem11);havoc #t~mem11; {4601#false} is VALID [2022-04-27 10:21:53,889 INFO L272 TraceCheckUtils]: 34: Hoare triple {4601#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {4601#false} is VALID [2022-04-27 10:21:53,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {4601#false} ~cond := #in~cond; {4601#false} is VALID [2022-04-27 10:21:53,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {4601#false} assume 0 == ~cond; {4601#false} is VALID [2022-04-27 10:21:53,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {4601#false} assume !false; {4601#false} is VALID [2022-04-27 10:21:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 10:21:53,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:21:53,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761738179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:53,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:21:53,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-04-27 10:21:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813613677] [2022-04-27 10:21:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:53,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:21:53,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:53,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:53,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:21:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:21:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:21:53,912 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:54,016 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2022-04-27 10:21:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:21:54,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:21:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 10:21:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-27 10:21:54,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-27 10:21:54,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:54,070 INFO L225 Difference]: With dead ends: 100 [2022-04-27 10:21:54,070 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 10:21:54,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:21:54,071 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:54,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:21:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 10:21:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2022-04-27 10:21:54,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:54,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,148 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,148 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:54,150 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2022-04-27 10:21:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-27 10:21:54,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:54,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:54,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 10:21:54,151 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 10:21:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:54,152 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2022-04-27 10:21:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-27 10:21:54,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:54,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:54,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:54,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-27 10:21:54,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 38 [2022-04-27 10:21:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:54,154 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-04-27 10:21:54,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-04-27 10:21:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 10:21:54,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:54,155 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:54,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:54,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1141850809, now seen corresponding path program 3 times [2022-04-27 10:21:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211761460] [2022-04-27 10:21:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:54,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {5099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5090#true} is VALID [2022-04-27 10:21:54,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5090#true} assume true; {5090#true} is VALID [2022-04-27 10:21:54,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5090#true} {5090#true} #133#return; {5090#true} is VALID [2022-04-27 10:21:54,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {5090#true} call ULTIMATE.init(); {5099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:54,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5090#true} is VALID [2022-04-27 10:21:54,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {5090#true} assume true; {5090#true} is VALID [2022-04-27 10:21:54,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5090#true} {5090#true} #133#return; {5090#true} is VALID [2022-04-27 10:21:54,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {5090#true} call #t~ret17 := main(); {5090#true} is VALID [2022-04-27 10:21:54,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {5090#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5095#(= main_~i~0 0)} is VALID [2022-04-27 10:21:54,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {5095#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5095#(= main_~i~0 0)} is VALID [2022-04-27 10:21:54,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5096#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:54,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {5096#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5096#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:54,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {5096#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5097#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:54,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {5097#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5097#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:54,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {5097#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5098#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {5098#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 5); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {5091#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {5091#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {5091#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {5091#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {5091#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {5091#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {5091#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {5091#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {5091#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {5091#false} assume !(0 != #t~mem4);havoc #t~mem4; {5091#false} is VALID [2022-04-27 10:21:54,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {5091#false} ~cont~0 := 0;~i~0 := 0; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {5091#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {5091#false} ~i~0 := 0;~cont_aux~0 := 0; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {5091#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {5091#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {5091#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {5091#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {5091#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {5091#false} assume !(~j~0 % 4294967296 < 2); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {5091#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {5091#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {5091#false} assume !(0 != #t~mem11);havoc #t~mem11; {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L272 TraceCheckUtils]: 35: Hoare triple {5091#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5091#false} is VALID [2022-04-27 10:21:54,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {5091#false} ~cond := #in~cond; {5091#false} is VALID [2022-04-27 10:21:54,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {5091#false} assume 0 == ~cond; {5091#false} is VALID [2022-04-27 10:21:54,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {5091#false} assume !false; {5091#false} is VALID [2022-04-27 10:21:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 10:21:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211761460] [2022-04-27 10:21:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211761460] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215493245] [2022-04-27 10:21:54,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:21:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:54,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:54,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:21:54,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 10:21:54,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:21:54,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:21:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:54,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:55,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 10:21:55,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:21:55,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-04-27 10:21:55,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {5090#true} call ULTIMATE.init(); {5090#true} is VALID [2022-04-27 10:21:55,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {5090#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5090#true} is VALID [2022-04-27 10:21:55,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {5090#true} assume true; {5090#true} is VALID [2022-04-27 10:21:55,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5090#true} {5090#true} #133#return; {5090#true} is VALID [2022-04-27 10:21:55,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {5090#true} call #t~ret17 := main(); {5090#true} is VALID [2022-04-27 10:21:55,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {5090#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5118#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:55,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {5118#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5122#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-27 10:21:55,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {5122#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5168#(and (or (and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:55,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {5168#(and (or (and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {5172#(and (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:55,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {5172#(and (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)))) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {5176#(and (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:55,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {5176#(and (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (- 4294967296) (mod main_~n_caracter~0 4294967296))) 0) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5180#(and (exists ((aux_mod_main_~n_caracter~0_35 Int)) (and (<= 0 aux_mod_main_~n_caracter~0_35) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod aux_mod_main_~n_caracter~0_35 4294967296) |main_~#input_string~0.offset|)) 0) (<= aux_mod_main_~n_caracter~0_35 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:21:55,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {5180#(and (exists ((aux_mod_main_~n_caracter~0_35 Int)) (and (<= 0 aux_mod_main_~n_caracter~0_35) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod aux_mod_main_~n_caracter~0_35 4294967296) |main_~#input_string~0.offset|)) 0) (<= aux_mod_main_~n_caracter~0_35 0))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {5184#(and (exists ((aux_mod_main_~n_caracter~0_35 Int)) (and (<= 0 aux_mod_main_~n_caracter~0_35) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod aux_mod_main_~n_caracter~0_35 4294967296) |main_~#input_string~0.offset|)) 0) (<= aux_mod_main_~n_caracter~0_35 0))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {5184#(and (exists ((aux_mod_main_~n_caracter~0_35 Int)) (and (<= 0 aux_mod_main_~n_caracter~0_35) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod aux_mod_main_~n_caracter~0_35 4294967296) |main_~#input_string~0.offset|)) 0) (<= aux_mod_main_~n_caracter~0_35 0))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5188#(= |main_#t~mem11| 0)} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {5188#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5091#false} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {5091#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {5091#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5091#false} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {5091#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5091#false} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {5091#false} assume !(~j~0 % 4294967296 < 2); {5091#false} is VALID [2022-04-27 10:21:55,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {5091#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {5091#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {5091#false} assume !(0 != #t~mem11);havoc #t~mem11; {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L272 TraceCheckUtils]: 35: Hoare triple {5091#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {5091#false} ~cond := #in~cond; {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {5091#false} assume 0 == ~cond; {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {5091#false} assume !false; {5091#false} is VALID [2022-04-27 10:21:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:21:55,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:55,398 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-27 10:21:55,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {5091#false} assume !false; {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {5091#false} assume 0 == ~cond; {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {5091#false} ~cond := #in~cond; {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L272 TraceCheckUtils]: 35: Hoare triple {5091#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {5091#false} assume !(0 != #t~mem11);havoc #t~mem11; {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {5091#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:55,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {5091#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5091#false} is VALID [2022-04-27 10:21:55,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {5091#false} assume !(~j~0 % 4294967296 < 2); {5091#false} is VALID [2022-04-27 10:21:55,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {5091#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5091#false} is VALID [2022-04-27 10:21:55,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {5091#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5091#false} is VALID [2022-04-27 10:21:55,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {5091#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5091#false} is VALID [2022-04-27 10:21:55,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {5188#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5091#false} is VALID [2022-04-27 10:21:55,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {5261#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0) (not (<= (mod main_~i~0 4294967296) 2147483647))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5188#(= |main_#t~mem11| 0)} is VALID [2022-04-27 10:21:55,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {5265#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} ~i~0 := 0;~cont_aux~0 := 0; {5261#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0) (not (<= (mod main_~i~0 4294967296) 2147483647))))} is VALID [2022-04-27 10:21:55,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {5269#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5265#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-27 10:21:55,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {5273#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (< 0 (mod main_~n_caracter~0 4294967296)))} ~cont~0 := 0;~i~0 := 0; {5269#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-27 10:21:55,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {5277#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= |main_#t~mem4| 0)) (< 0 (mod main_~n_caracter~0 4294967296)))} assume !(0 != #t~mem4);havoc #t~mem4; {5273#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (< 0 (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-27 10:21:55,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {5090#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5277#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= |main_#t~mem4| 0)) (< 0 (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-27 10:21:55,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {5090#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {5090#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {5090#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {5090#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#true} assume !(~i~0 % 4294967296 < 5); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {5090#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {5090#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {5090#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {5090#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {5090#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {5090#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {5090#true} call #t~ret17 := main(); {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5090#true} {5090#true} #133#return; {5090#true} is VALID [2022-04-27 10:21:55,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {5090#true} assume true; {5090#true} is VALID [2022-04-27 10:21:55,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {5090#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5090#true} is VALID [2022-04-27 10:21:55,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {5090#true} call ULTIMATE.init(); {5090#true} is VALID [2022-04-27 10:21:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 10:21:55,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215493245] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:55,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:21:55,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 10] total 20 [2022-04-27 10:21:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333058290] [2022-04-27 10:21:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 10:21:55,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:55,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:21:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:21:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:21:55,465 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:55,793 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2022-04-27 10:21:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:21:55,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 10:21:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-27 10:21:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-27 10:21:55,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-27 10:21:55,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:55,840 INFO L225 Difference]: With dead ends: 96 [2022-04-27 10:21:55,840 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 10:21:55,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:21:55,841 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:55,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 10:21:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-27 10:21:55,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:55,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,922 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,922 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:55,923 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-27 10:21:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-27 10:21:55,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:55,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:55,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 10:21:55,924 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 10:21:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:55,925 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-27 10:21:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-27 10:21:55,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:55,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:55,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:55,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-27 10:21:55,927 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 39 [2022-04-27 10:21:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:55,928 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-27 10:21:55,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-27 10:21:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 10:21:55,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:55,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-04-27 10:21:55,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 10:21:56,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1453651082, now seen corresponding path program 1 times [2022-04-27 10:21:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538865741] [2022-04-27 10:21:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:56,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {5728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5719#true} is VALID [2022-04-27 10:21:56,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {5719#true} assume true; {5719#true} is VALID [2022-04-27 10:21:56,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5719#true} {5719#true} #133#return; {5719#true} is VALID [2022-04-27 10:21:56,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {5719#true} call ULTIMATE.init(); {5728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:56,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {5728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5719#true} is VALID [2022-04-27 10:21:56,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {5719#true} assume true; {5719#true} is VALID [2022-04-27 10:21:56,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5719#true} {5719#true} #133#return; {5719#true} is VALID [2022-04-27 10:21:56,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {5719#true} call #t~ret17 := main(); {5719#true} is VALID [2022-04-27 10:21:56,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {5719#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5724#(= main_~i~0 0)} is VALID [2022-04-27 10:21:56,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {5724#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5724#(= main_~i~0 0)} is VALID [2022-04-27 10:21:56,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {5724#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5725#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:56,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {5725#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5725#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:21:56,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {5725#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5726#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:56,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {5726#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5726#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:21:56,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {5726#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5727#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {5727#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 5); {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {5720#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {5720#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {5720#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {5720#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {5720#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {5720#false} assume !(0 != #t~mem4);havoc #t~mem4; {5720#false} is VALID [2022-04-27 10:21:56,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {5720#false} ~cont~0 := 0;~i~0 := 0; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {5720#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {5720#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {5720#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {5720#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {5720#false} assume !(~j~0 % 4294967296 < 2); {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {5720#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {5720#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {5720#false} ~i~0 := 0;~cont_aux~0 := 0; {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {5720#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {5720#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {5720#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {5720#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {5720#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {5720#false} assume !(~j~0 % 4294967296 < 2); {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {5720#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {5720#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {5720#false} assume !(0 != #t~mem11);havoc #t~mem11; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L272 TraceCheckUtils]: 37: Hoare triple {5720#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {5720#false} ~cond := #in~cond; {5720#false} is VALID [2022-04-27 10:21:56,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {5720#false} assume 0 == ~cond; {5720#false} is VALID [2022-04-27 10:21:56,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {5720#false} assume !false; {5720#false} is VALID [2022-04-27 10:21:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 10:21:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:56,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538865741] [2022-04-27 10:21:56,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538865741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:56,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381816227] [2022-04-27 10:21:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:56,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:56,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:56,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:21:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:56,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:21:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:56,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:56,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {5719#true} call ULTIMATE.init(); {5719#true} is VALID [2022-04-27 10:21:56,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {5719#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5719#true} is VALID [2022-04-27 10:21:56,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {5719#true} assume true; {5719#true} is VALID [2022-04-27 10:21:56,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5719#true} {5719#true} #133#return; {5719#true} is VALID [2022-04-27 10:21:56,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {5719#true} call #t~ret17 := main(); {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {5719#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5724#(= main_~i~0 0)} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {5724#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5724#(= main_~i~0 0)} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {5724#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {5719#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {5719#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {5719#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {5719#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {5719#true} assume !(~i~0 % 4294967296 < 5); {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {5719#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {5719#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {5719#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5719#true} is VALID [2022-04-27 10:21:56,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {5719#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5719#true} is VALID [2022-04-27 10:21:56,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {5719#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5719#true} is VALID [2022-04-27 10:21:56,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {5719#true} assume !(0 != #t~mem4);havoc #t~mem4; {5719#true} is VALID [2022-04-27 10:21:56,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {5719#true} ~cont~0 := 0;~i~0 := 0; {5789#(= main_~cont~0 0)} is VALID [2022-04-27 10:21:56,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {5789#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5789#(= main_~cont~0 0)} is VALID [2022-04-27 10:21:56,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {5789#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5789#(= main_~cont~0 0)} is VALID [2022-04-27 10:21:56,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {5789#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {5799#(= (+ (- 1) main_~cont~0) 0)} is VALID [2022-04-27 10:21:56,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {5799#(= (+ (- 1) main_~cont~0) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5799#(= (+ (- 1) main_~cont~0) 0)} is VALID [2022-04-27 10:21:56,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {5799#(= (+ (- 1) main_~cont~0) 0)} assume !(~j~0 % 4294967296 < 2); {5799#(= (+ (- 1) main_~cont~0) 0)} is VALID [2022-04-27 10:21:56,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {5799#(= (+ (- 1) main_~cont~0) 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5799#(= (+ (- 1) main_~cont~0) 0)} is VALID [2022-04-27 10:21:56,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {5799#(= (+ (- 1) main_~cont~0) 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5799#(= (+ (- 1) main_~cont~0) 0)} is VALID [2022-04-27 10:21:56,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {5799#(= (+ (- 1) main_~cont~0) 0)} ~i~0 := 0;~cont_aux~0 := 0; {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} is VALID [2022-04-27 10:21:56,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} is VALID [2022-04-27 10:21:56,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} is VALID [2022-04-27 10:21:56,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} is VALID [2022-04-27 10:21:56,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {5815#(and (= (+ (- 1) main_~cont~0) 0) (= main_~cont_aux~0 0))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} assume !(~j~0 % 4294967296 < 2); {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} assume !(0 != #t~mem11);havoc #t~mem11; {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} is VALID [2022-04-27 10:21:56,549 INFO L272 TraceCheckUtils]: 37: Hoare triple {5828#(and (= (+ (- 1) main_~cont~0) 0) (= (+ (- 1) main_~cont_aux~0) 0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:56,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {5847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:56,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {5851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5720#false} is VALID [2022-04-27 10:21:56,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {5720#false} assume !false; {5720#false} is VALID [2022-04-27 10:21:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:21:56,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:56,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {5720#false} assume !false; {5720#false} is VALID [2022-04-27 10:21:56,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {5851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5720#false} is VALID [2022-04-27 10:21:56,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {5847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:56,738 INFO L272 TraceCheckUtils]: 37: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:56,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(0 != #t~mem11);havoc #t~mem11; {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5867#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {5899#(= (mod main_~cont~0 4294967296) 1)} ~i~0 := 0;~cont_aux~0 := 0; {5886#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:21:56,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {5899#(= (mod main_~cont~0 4294967296) 1)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5899#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-27 10:21:56,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {5899#(= (mod main_~cont~0 4294967296) 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5899#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-27 10:21:56,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {5899#(= (mod main_~cont~0 4294967296) 1)} assume !(~j~0 % 4294967296 < 2); {5899#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-27 10:21:56,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {5899#(= (mod main_~cont~0 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5899#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-27 10:21:56,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {5899#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-27 10:21:56,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} is VALID [2022-04-27 10:21:56,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {5719#true} ~cont~0 := 0;~i~0 := 0; {5915#(= (mod (+ main_~cont~0 1) 4294967296) 1)} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {5719#true} assume !(0 != #t~mem4);havoc #t~mem4; {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {5719#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {5719#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {5719#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {5719#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {5719#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {5719#true} assume !(~i~0 % 4294967296 < 5); {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {5719#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {5719#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {5719#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {5719#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {5719#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {5719#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {5719#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {5719#true} call #t~ret17 := main(); {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5719#true} {5719#true} #133#return; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {5719#true} assume true; {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {5719#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {5719#true} call ULTIMATE.init(); {5719#true} is VALID [2022-04-27 10:21:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 10:21:56,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381816227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:56,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:56,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2022-04-27 10:21:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096411636] [2022-04-27 10:21:56,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 10:21:56,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:56,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:56,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:56,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 10:21:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 10:21:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:21:56,827 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:00,839 INFO L93 Difference]: Finished difference Result 391 states and 526 transitions. [2022-04-27 10:22:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 10:22:00,839 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 10:22:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:22:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 458 transitions. [2022-04-27 10:22:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 458 transitions. [2022-04-27 10:22:00,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 458 transitions. [2022-04-27 10:22:01,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 458 edges. 458 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:01,251 INFO L225 Difference]: With dead ends: 391 [2022-04-27 10:22:01,251 INFO L226 Difference]: Without dead ends: 342 [2022-04-27 10:22:01,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:22:01,253 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 575 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:01,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 174 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 10:22:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-27 10:22:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 74. [2022-04-27 10:22:01,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:01,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:01,374 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:01,375 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:01,382 INFO L93 Difference]: Finished difference Result 342 states and 461 transitions. [2022-04-27 10:22:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 461 transitions. [2022-04-27 10:22:01,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:01,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:01,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-27 10:22:01,383 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-27 10:22:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:01,391 INFO L93 Difference]: Finished difference Result 342 states and 461 transitions. [2022-04-27 10:22:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 461 transitions. [2022-04-27 10:22:01,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:01,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:01,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:01,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-04-27 10:22:01,393 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 41 [2022-04-27 10:22:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:01,393 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-04-27 10:22:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 15 states have internal predecessors, (84), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-27 10:22:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 10:22:01,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:01,394 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2022-04-27 10:22:01,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 10:22:01,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:01,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash 42701330, now seen corresponding path program 1 times [2022-04-27 10:22:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:01,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486317041] [2022-04-27 10:22:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:01,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {7419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7409#true} is VALID [2022-04-27 10:22:01,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#true} assume true; {7409#true} is VALID [2022-04-27 10:22:01,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#true} {7409#true} #133#return; {7409#true} is VALID [2022-04-27 10:22:01,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {7409#true} call ULTIMATE.init(); {7419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:22:01,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {7419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7409#true} is VALID [2022-04-27 10:22:01,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {7409#true} assume true; {7409#true} is VALID [2022-04-27 10:22:01,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7409#true} {7409#true} #133#return; {7409#true} is VALID [2022-04-27 10:22:01,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {7409#true} call #t~ret17 := main(); {7409#true} is VALID [2022-04-27 10:22:01,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {7409#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7414#(= main_~i~0 0)} is VALID [2022-04-27 10:22:01,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {7414#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7414#(= main_~i~0 0)} is VALID [2022-04-27 10:22:01,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {7414#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7415#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:22:01,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {7415#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7415#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 10:22:01,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7416#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:22:01,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {7416#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7416#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-27 10:22:01,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {7416#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7417#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:22:01,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {7417#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7417#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-27 10:22:01,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {7417#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7418#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:01,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {7418#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {7410#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {7410#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {7410#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {7410#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {7410#false} assume !(0 != #t~mem4);havoc #t~mem4; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {7410#false} ~cont~0 := 0;~i~0 := 0; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {7410#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {7410#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {7410#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {7410#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {7410#false} assume !(~j~0 % 4294967296 < 2); {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {7410#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7410#false} is VALID [2022-04-27 10:22:01,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {7410#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {7410#false} ~i~0 := 0;~cont_aux~0 := 0; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {7410#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {7410#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {7410#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {7410#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {7410#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {7410#false} assume !(~j~0 % 4294967296 < 2); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {7410#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {7410#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {7410#false} assume !(0 != #t~mem11);havoc #t~mem11; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L272 TraceCheckUtils]: 39: Hoare triple {7410#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {7410#false} ~cond := #in~cond; {7410#false} is VALID [2022-04-27 10:22:01,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {7410#false} assume 0 == ~cond; {7410#false} is VALID [2022-04-27 10:22:01,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {7410#false} assume !false; {7410#false} is VALID [2022-04-27 10:22:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 10:22:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486317041] [2022-04-27 10:22:01,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486317041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429852232] [2022-04-27 10:22:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:01,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:01,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:22:01,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 10:22:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:01,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 10:22:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:01,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:22:02,182 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 10:22:02,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-27 10:22:02,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {7409#true} call ULTIMATE.init(); {7409#true} is VALID [2022-04-27 10:22:02,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7409#true} is VALID [2022-04-27 10:22:02,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {7409#true} assume true; {7409#true} is VALID [2022-04-27 10:22:02,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7409#true} {7409#true} #133#return; {7409#true} is VALID [2022-04-27 10:22:02,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {7409#true} call #t~ret17 := main(); {7409#true} is VALID [2022-04-27 10:22:02,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {7409#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7438#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {7438#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {7442#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {7438#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {7438#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {7491#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {7491#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7495#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|))} is VALID [2022-04-27 10:22:02,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {7495#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:02,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {7499#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {7515#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {7515#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7515#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {7515#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7522#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:02,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {7522#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7526#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {7526#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {7410#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {7410#false} assume !(~j~0 % 4294967296 < 2); {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {7410#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {7410#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {7410#false} assume !(0 != #t~mem11);havoc #t~mem11; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L272 TraceCheckUtils]: 39: Hoare triple {7410#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {7410#false} ~cond := #in~cond; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {7410#false} assume 0 == ~cond; {7410#false} is VALID [2022-04-27 10:22:02,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {7410#false} assume !false; {7410#false} is VALID [2022-04-27 10:22:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 10:22:02,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:22:02,593 INFO L356 Elim1Store]: treesize reduction 37, result has 75.5 percent of original size [2022-04-27 10:22:02,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 139 [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {7410#false} assume !false; {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {7410#false} assume 0 == ~cond; {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {7410#false} ~cond := #in~cond; {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L272 TraceCheckUtils]: 39: Hoare triple {7410#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {7410#false} assume !(0 != #t~mem11);havoc #t~mem11; {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {7410#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {7410#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7410#false} is VALID [2022-04-27 10:22:03,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {7410#false} assume !(~j~0 % 4294967296 < 2); {7410#false} is VALID [2022-04-27 10:22:03,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {7410#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7410#false} is VALID [2022-04-27 10:22:03,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {7526#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {7410#false} is VALID [2022-04-27 10:22:03,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {7587#(or (and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))))) (not (< (mod main_~j~0 4294967296) 2)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7526#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-27 10:22:03,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {7591#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (<= (mod main_~i~0 4294967296) 2147483647)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7587#(or (and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))))) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-27 10:22:03,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {7591#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (<= (mod main_~i~0 4294967296) 2147483647)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7591#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (<= (mod main_~i~0 4294967296) 2147483647)))} is VALID [2022-04-27 10:22:03,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {7591#(and (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (<= (mod main_~i~0 4294967296) 2147483647)))} is VALID [2022-04-27 10:22:03,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-27 10:22:03,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-27 10:22:03,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !(~j~0 % 4294967296 < 2); {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-27 10:22:03,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-27 10:22:03,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {7614#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {7598#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-27 10:22:03,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {7618#(or (and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0)) (not (< (mod main_~j~0 4294967296) 2)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7614#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {7622#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {7618#(or (and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0)) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {7409#true} ~cont~0 := 0;~i~0 := 0; {7622#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#true} assume !(0 != #t~mem4);havoc #t~mem4; {7409#true} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {7409#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7409#true} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7409#true} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {7409#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7409#true} is VALID [2022-04-27 10:22:03,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {7409#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {7409#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {7409#true} assume !(~i~0 % 4294967296 < 5); {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {7409#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {7409#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {7409#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {7409#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {7409#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {7409#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {7409#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {7409#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {7409#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {7409#true} call #t~ret17 := main(); {7409#true} is VALID [2022-04-27 10:22:03,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7409#true} {7409#true} #133#return; {7409#true} is VALID [2022-04-27 10:22:03,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {7409#true} assume true; {7409#true} is VALID [2022-04-27 10:22:03,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {7409#true} is VALID [2022-04-27 10:22:03,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {7409#true} call ULTIMATE.init(); {7409#true} is VALID [2022-04-27 10:22:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 10:22:03,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429852232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:22:03,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:22:03,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2022-04-27 10:22:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298227028] [2022-04-27 10:22:03,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:22:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:22:03,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:22:03,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:03,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:03,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:22:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:22:03,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:22:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:22:03,084 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:07,273 INFO L93 Difference]: Finished difference Result 528 states and 713 transitions. [2022-04-27 10:22:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:22:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 10:22:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:22:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 293 transitions. [2022-04-27 10:22:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 293 transitions. [2022-04-27 10:22:07,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 293 transitions. [2022-04-27 10:22:07,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:07,545 INFO L225 Difference]: With dead ends: 528 [2022-04-27 10:22:07,545 INFO L226 Difference]: Without dead ends: 469 [2022-04-27 10:22:07,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=490, Invalid=1960, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:22:07,547 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 836 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:07,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 113 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 10:22:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-27 10:22:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 100. [2022-04-27 10:22:07,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:07,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,750 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,750 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:07,761 INFO L93 Difference]: Finished difference Result 469 states and 634 transitions. [2022-04-27 10:22:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2022-04-27 10:22:07,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:07,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:07,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-27 10:22:07,763 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-27 10:22:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:07,775 INFO L93 Difference]: Finished difference Result 469 states and 634 transitions. [2022-04-27 10:22:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2022-04-27 10:22:07,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:07,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:07,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:07,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-04-27 10:22:07,778 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 43 [2022-04-27 10:22:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:07,778 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-04-27 10:22:07,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 21 states have internal predecessors, (82), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-04-27 10:22:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 10:22:07,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:07,779 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1] [2022-04-27 10:22:07,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 10:22:07,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 10:22:07,994 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1964210228, now seen corresponding path program 1 times [2022-04-27 10:22:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:07,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541738962] [2022-04-27 10:22:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:08,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {9597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9590#true} is VALID [2022-04-27 10:22:08,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {9590#true} assume true; {9590#true} is VALID [2022-04-27 10:22:08,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9590#true} {9590#true} #133#return; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {9590#true} call ULTIMATE.init(); {9597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {9597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#true} assume true; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#true} {9590#true} #133#return; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#true} call #t~ret17 := main(); {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:08,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#true} assume !(~i~0 % 4294967296 < 5); {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {9590#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {9590#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {9590#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {9590#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {9590#true} assume !(0 != #t~mem4);havoc #t~mem4; {9590#true} is VALID [2022-04-27 10:22:08,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {9590#true} ~cont~0 := 0;~i~0 := 0; {9590#true} is VALID [2022-04-27 10:22:08,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {9595#(= main_~j~0 0)} is VALID [2022-04-27 10:22:08,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {9595#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9595#(= main_~j~0 0)} is VALID [2022-04-27 10:22:08,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {9595#(= main_~j~0 0)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {9595#(= main_~j~0 0)} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {9595#(= main_~j~0 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9596#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {9596#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < 2); {9591#false} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {9591#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9591#false} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {9591#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9591#false} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {9591#false} ~i~0 := 0;~cont_aux~0 := 0; {9591#false} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {9591#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9591#false} is VALID [2022-04-27 10:22:08,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {9591#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {9591#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {9591#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {9591#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {9591#false} assume !(~j~0 % 4294967296 < 2); {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {9591#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {9591#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {9591#false} assume !(0 != #t~mem11);havoc #t~mem11; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L272 TraceCheckUtils]: 41: Hoare triple {9591#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {9591#false} ~cond := #in~cond; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {9591#false} assume 0 == ~cond; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {9591#false} assume !false; {9591#false} is VALID [2022-04-27 10:22:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 10:22:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:08,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541738962] [2022-04-27 10:22:08,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541738962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:08,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914388056] [2022-04-27 10:22:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:08,094 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:22:08,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 10:22:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:08,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 10:22:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:08,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:22:08,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-27 10:22:08,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2022-04-27 10:22:08,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {9590#true} call ULTIMATE.init(); {9590#true} is VALID [2022-04-27 10:22:08,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {9590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9590#true} is VALID [2022-04-27 10:22:08,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#true} assume true; {9590#true} is VALID [2022-04-27 10:22:08,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#true} {9590#true} #133#return; {9590#true} is VALID [2022-04-27 10:22:08,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#true} call #t~ret17 := main(); {9590#true} is VALID [2022-04-27 10:22:08,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9616#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {9616#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {9620#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {9616#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {9616#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {9675#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {9675#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|))} is VALID [2022-04-27 10:22:08,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {9679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-27 10:22:08,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {9683#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {9699#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,596 INFO L290 TraceCheckUtils]: 32: Hoare triple {9699#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9699#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {9699#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {9706#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-27 10:22:08,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {9706#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9710#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {9710#(not (= |main_#t~mem14| |main_#t~mem13|))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {9591#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {9591#false} assume !(~j~0 % 4294967296 < 2); {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {9591#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {9591#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {9591#false} assume !(0 != #t~mem11);havoc #t~mem11; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L272 TraceCheckUtils]: 41: Hoare triple {9591#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {9591#false} ~cond := #in~cond; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {9591#false} assume 0 == ~cond; {9591#false} is VALID [2022-04-27 10:22:08,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {9591#false} assume !false; {9591#false} is VALID [2022-04-27 10:22:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 10:22:08,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:22:08,958 INFO L356 Elim1Store]: treesize reduction 44, result has 70.9 percent of original size [2022-04-27 10:22:08,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 136 [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {9591#false} assume !false; {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {9591#false} assume 0 == ~cond; {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {9591#false} ~cond := #in~cond; {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L272 TraceCheckUtils]: 41: Hoare triple {9591#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {9591#false} assume !(0 != #t~mem11);havoc #t~mem11; {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {9591#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {9591#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {9591#false} assume !(~j~0 % 4294967296 < 2); {9591#false} is VALID [2022-04-27 10:22:09,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {9591#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9591#false} is VALID [2022-04-27 10:22:09,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {9710#(not (= |main_#t~mem14| |main_#t~mem13|))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9591#false} is VALID [2022-04-27 10:22:09,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {9771#(or (and (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)))) (<= (mod main_~i~0 4294967296) 2147483647))) (not (< (mod main_~j~0 4294967296) 2)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9710#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-27 10:22:09,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {9775#(and (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {9771#(or (and (or (not (<= (mod main_~i~0 4294967296) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)))) (<= (mod main_~i~0 4294967296) 2147483647))) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-27 10:22:09,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {9775#(and (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9775#(and (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)))} is VALID [2022-04-27 10:22:09,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {9775#(and (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (not (<= (mod main_~i~0 4294967296) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)))} is VALID [2022-04-27 10:22:09,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:09,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:09,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:09,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:09,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {9798#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_#t~mem9| |main_#t~mem8|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {9782#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:09,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {9802#(or (and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0)) (not (< (mod main_~j~0 4294967296) 2)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9798#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))) (= |main_#t~mem9| |main_#t~mem8|))} is VALID [2022-04-27 10:22:09,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {9806#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {9802#(or (and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0)) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-27 10:22:09,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {9590#true} ~cont~0 := 0;~i~0 := 0; {9806#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-27 10:22:09,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {9590#true} assume !(0 != #t~mem4);havoc #t~mem4; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {9590#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {9590#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {9590#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {9590#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {9590#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {9590#true} assume !(~i~0 % 4294967296 < 5); {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {9590#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {9590#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {9590#true} call #t~ret17 := main(); {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9590#true} {9590#true} #133#return; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {9590#true} assume true; {9590#true} is VALID [2022-04-27 10:22:09,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {9590#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {9590#true} is VALID [2022-04-27 10:22:09,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {9590#true} call ULTIMATE.init(); {9590#true} is VALID [2022-04-27 10:22:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 10:22:09,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914388056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:22:09,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:22:09,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 19 [2022-04-27 10:22:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373818326] [2022-04-27 10:22:09,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:22:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-27 10:22:09,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:22:09,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:09,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:09,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 10:22:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:22:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 10:22:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:22:09,501 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:11,338 INFO L93 Difference]: Finished difference Result 316 states and 435 transitions. [2022-04-27 10:22:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 10:22:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-27 10:22:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:22:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 177 transitions. [2022-04-27 10:22:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 177 transitions. [2022-04-27 10:22:11,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 177 transitions. [2022-04-27 10:22:11,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:11,523 INFO L225 Difference]: With dead ends: 316 [2022-04-27 10:22:11,524 INFO L226 Difference]: Without dead ends: 243 [2022-04-27 10:22:11,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 10:22:11,526 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 248 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:11,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 87 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 10:22:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-27 10:22:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 132. [2022-04-27 10:22:11,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:11,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,857 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,857 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:11,862 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2022-04-27 10:22:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 320 transitions. [2022-04-27 10:22:11,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:11,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:11,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 243 states. [2022-04-27 10:22:11,863 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 243 states. [2022-04-27 10:22:11,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:11,867 INFO L93 Difference]: Finished difference Result 243 states and 320 transitions. [2022-04-27 10:22:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 320 transitions. [2022-04-27 10:22:11,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:11,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:11,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:11,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 127 states have internal predecessors, (161), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-04-27 10:22:11,871 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 45 [2022-04-27 10:22:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:11,871 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-04-27 10:22:11,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-04-27 10:22:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 10:22:11,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:11,872 INFO L195 NwaCegarLoop]: 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] [2022-04-27 10:22:11,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 10:22:12,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 10:22:12,095 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash 28908263, now seen corresponding path program 2 times [2022-04-27 10:22:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:12,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228862074] [2022-04-27 10:22:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:12,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {11040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11027#true} is VALID [2022-04-27 10:22:12,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {11027#true} assume true; {11027#true} is VALID [2022-04-27 10:22:12,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11027#true} {11027#true} #133#return; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {11027#true} call ULTIMATE.init(); {11040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {11027#true} assume true; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11027#true} {11027#true} #133#return; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {11027#true} call #t~ret17 := main(); {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {11027#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {11027#true} assume !(~i~0 % 4294967296 < 5); {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {11027#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {11027#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {11027#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:12,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {11027#true} assume !(0 != #t~mem4);havoc #t~mem4; {11027#true} is VALID [2022-04-27 10:22:12,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {11027#true} ~cont~0 := 0;~i~0 := 0; {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {11032#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {11032#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {11032#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-27 10:22:12,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-27 10:22:12,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-27 10:22:12,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {11036#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} assume !(~j~0 % 4294967296 < 2); {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} assume !(0 != #t~mem11);havoc #t~mem11; {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} is VALID [2022-04-27 10:22:12,397 INFO L272 TraceCheckUtils]: 47: Hoare triple {11037#(and (<= (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ (* 4294967296 (div main_~cont_aux~0 4294967296)) main_~cont~0 1)) (<= main_~cont~0 main_~cont_aux~0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {11038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:22:12,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {11038#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11039#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:22:12,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {11039#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11028#false} is VALID [2022-04-27 10:22:12,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {11028#false} assume !false; {11028#false} is VALID [2022-04-27 10:22:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 10:22:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228862074] [2022-04-27 10:22:12,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228862074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986703453] [2022-04-27 10:22:12,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:22:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:12,401 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:22:12,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 10:22:12,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:22:12,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:22:12,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:22:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:12,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:22:12,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {11027#true} call ULTIMATE.init(); {11027#true} is VALID [2022-04-27 10:22:12,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {11027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11027#true} is VALID [2022-04-27 10:22:12,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {11027#true} assume true; {11027#true} is VALID [2022-04-27 10:22:12,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11027#true} {11027#true} #133#return; {11027#true} is VALID [2022-04-27 10:22:12,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {11027#true} call #t~ret17 := main(); {11027#true} is VALID [2022-04-27 10:22:12,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {11027#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {11059#(= main_~i~0 0)} is VALID [2022-04-27 10:22:12,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {11059#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11059#(= main_~i~0 0)} is VALID [2022-04-27 10:22:12,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {11059#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11066#(= main_~i~0 1)} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {11066#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11066#(= main_~i~0 1)} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {11066#(= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {11027#true} assume !(~i~0 % 4294967296 < 5); {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {11027#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {11027#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {11027#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:12,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {11027#true} assume !(0 != #t~mem4);havoc #t~mem4; {11027#true} is VALID [2022-04-27 10:22:12,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {11027#true} ~cont~0 := 0;~i~0 := 0; {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {11032#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {11032#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11032#(= main_~cont~0 0)} is VALID [2022-04-27 10:22:12,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {11032#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-27 10:22:12,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {11033#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {11034#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {11035#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,964 INFO L290 TraceCheckUtils]: 39: Hoare triple {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {11160#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(0 != #t~mem11);havoc #t~mem11; {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-27 10:22:12,967 INFO L272 TraceCheckUtils]: 47: Hoare triple {11170#(and (= (+ (- 2) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {11189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:22:12,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {11189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:22:12,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {11193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11028#false} is VALID [2022-04-27 10:22:12,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {11028#false} assume !false; {11028#false} is VALID [2022-04-27 10:22:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 10:22:12,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:22:13,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {11028#false} assume !false; {11028#false} is VALID [2022-04-27 10:22:13,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {11193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11028#false} is VALID [2022-04-27 10:22:13,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {11189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:22:13,190 INFO L272 TraceCheckUtils]: 47: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {11189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:22:13,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(0 != #t~mem11);havoc #t~mem11; {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11209#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {11228#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {11251#(= 2 (mod main_~cont~0 4294967296))} ~i~0 := 0;~cont_aux~0 := 0; {11238#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {11251#(= 2 (mod main_~cont~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {11251#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {11251#(= 2 (mod main_~cont~0 4294967296))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {11251#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {11251#(= 2 (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {11251#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {11251#(= 2 (mod main_~cont~0 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11251#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11251#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-27 10:22:13,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-27 10:22:13,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-27 10:22:13,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {11267#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-27 10:22:13,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {11027#true} ~cont~0 := 0;~i~0 := 0; {11277#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {11027#true} assume !(0 != #t~mem4);havoc #t~mem4; {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {11027#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {11027#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {11027#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {11027#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {11027#true} assume !(~i~0 % 4294967296 < 5); {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:13,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {11027#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {11027#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {11027#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {11027#true} call #t~ret17 := main(); {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11027#true} {11027#true} #133#return; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {11027#true} assume true; {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {11027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {11027#true} is VALID [2022-04-27 10:22:13,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {11027#true} call ULTIMATE.init(); {11027#true} is VALID [2022-04-27 10:22:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 10:22:13,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986703453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:22:13,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:22:13,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 23 [2022-04-27 10:22:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309868130] [2022-04-27 10:22:13,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:22:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-27 10:22:13,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:22:13,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:13,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:13,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 10:22:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:22:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 10:22:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:22:13,262 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:18,855 INFO L93 Difference]: Finished difference Result 503 states and 670 transitions. [2022-04-27 10:22:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 10:22:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-27 10:22:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:22:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 382 transitions. [2022-04-27 10:22:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 382 transitions. [2022-04-27 10:22:18,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 382 transitions. [2022-04-27 10:22:19,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:19,267 INFO L225 Difference]: With dead ends: 503 [2022-04-27 10:22:19,268 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 10:22:19,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=2519, Unknown=0, NotChecked=0, Total=2862 [2022-04-27 10:22:19,270 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 626 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:19,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 186 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 10:22:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 10:22:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 170. [2022-04-27 10:22:19,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:19,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:19,690 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:19,690 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:19,703 INFO L93 Difference]: Finished difference Result 497 states and 663 transitions. [2022-04-27 10:22:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 663 transitions. [2022-04-27 10:22:19,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:19,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:19,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-27 10:22:19,705 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-27 10:22:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:19,717 INFO L93 Difference]: Finished difference Result 497 states and 663 transitions. [2022-04-27 10:22:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 663 transitions. [2022-04-27 10:22:19,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:19,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:19,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:19,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 165 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2022-04-27 10:22:19,721 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 51 [2022-04-27 10:22:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:19,721 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2022-04-27 10:22:19,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 20 states have internal predecessors, (79), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2022-04-27 10:22:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 10:22:19,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:19,722 INFO L195 NwaCegarLoop]: 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] [2022-04-27 10:22:19,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 10:22:19,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 10:22:19,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -364118747, now seen corresponding path program 1 times [2022-04-27 10:22:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455745575] [2022-04-27 10:22:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:20,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {13381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13370#true} is VALID [2022-04-27 10:22:20,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {13370#true} assume true; {13370#true} is VALID [2022-04-27 10:22:20,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13370#true} {13370#true} #133#return; {13370#true} is VALID [2022-04-27 10:22:20,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {13370#true} call ULTIMATE.init(); {13381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:22:20,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {13381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {13370#true} is VALID [2022-04-27 10:22:20,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {13370#true} assume true; {13370#true} is VALID [2022-04-27 10:22:20,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13370#true} {13370#true} #133#return; {13370#true} is VALID [2022-04-27 10:22:20,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {13370#true} call #t~ret17 := main(); {13370#true} is VALID [2022-04-27 10:22:20,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {13370#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.allocOnStack(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.allocOnStack(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !(~i~0 % 4294967296 < 5); {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !(0 != #t~mem4);havoc #t~mem4; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} ~cont~0 := 0;~i~0 := 0; {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-27 10:22:20,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {13375#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {13376#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))))) (= main_~j~0 0))} is VALID [2022-04-27 10:22:20,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {13376#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))))) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {13377#(and (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296))))) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))) (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|)) (= main_~j~0 0))} is VALID [2022-04-27 10:22:20,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {13377#(and (or (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296))))) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))) (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|)) (= main_~j~0 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {13378#(and (= |main_~#vogal_array~0.offset| 0) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296))))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= main_~j~0 0) (or (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))))} is VALID [2022-04-27 10:22:20,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {13378#(and (= |main_~#vogal_array~0.offset| 0) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296))))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= main_~j~0 0) (or (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13379#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (or (and (<= (div main_~j~0 4294967296) 0) (<= 1 main_~j~0)) (and (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296)))) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)))) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (and (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296)))))) (or (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))))))} is VALID [2022-04-27 10:22:20,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {13379#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (or (and (<= (div main_~j~0 4294967296) 0) (<= 1 main_~j~0)) (and (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296)))) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)))) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (and (or (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset| (- 4294967296)))))) (or (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296)))) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {13380#(and (not (= |main_#t~mem9| |main_#t~mem8|)) (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|)))} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {13380#(and (not (= |main_#t~mem9| |main_#t~mem8|)) (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {13371#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {13371#false} assume !(~j~0 % 4294967296 < 2); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {13371#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {13371#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {13371#false} ~i~0 := 0;~cont_aux~0 := 0; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {13371#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {13371#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {13371#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {13371#false} assume #t~mem13 == #t~mem14;havoc #t~mem13;havoc #t~mem14;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {13371#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {13371#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {13371#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {13371#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {13371#false} assume !(~j~0 % 4294967296 < 2); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {13371#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {13371#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {13371#false} is VALID [2022-04-27 10:22:20,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {13371#false} assume !(0 != #t~mem11);havoc #t~mem11; {13371#false} is VALID [2022-04-27 10:22:20,687 INFO L272 TraceCheckUtils]: 47: Hoare triple {13371#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {13371#false} is VALID [2022-04-27 10:22:20,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {13371#false} ~cond := #in~cond; {13371#false} is VALID [2022-04-27 10:22:20,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {13371#false} assume 0 == ~cond; {13371#false} is VALID [2022-04-27 10:22:20,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {13371#false} assume !false; {13371#false} is VALID [2022-04-27 10:22:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-27 10:22:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:20,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455745575] [2022-04-27 10:22:20,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455745575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:20,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558075823] [2022-04-27 10:22:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:20,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:20,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:22:20,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 10:22:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:20,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-27 10:22:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:20,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:22:33,009 INFO L356 Elim1Store]: treesize reduction 82, result has 65.1 percent of original size [2022-04-27 10:22:33,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 251 [2022-04-27 10:22:35,209 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 10:22:35,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 10:22:35,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 10:22:35,410 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:577) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:490) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:422) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:311) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:327) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:234) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:201) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:185) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:825) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:786) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:704) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:470) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:232) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 10:22:35,415 INFO L158 Benchmark]: Toolchain (without parser) took 52995.41ms. Allocated memory was 176.2MB in the beginning and 300.9MB in the end (delta: 124.8MB). Free memory was 118.5MB in the beginning and 265.5MB in the end (delta: -147.0MB). Peak memory consumption was 153.9MB. Max. memory is 8.0GB. [2022-04-27 10:22:35,415 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 154.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:22:35,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.06ms. Allocated memory was 176.2MB in the beginning and 250.6MB in the end (delta: 74.4MB). Free memory was 118.4MB in the beginning and 222.0MB in the end (delta: -103.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-04-27 10:22:35,415 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 250.6MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:22:35,415 INFO L158 Benchmark]: RCFGBuilder took 408.17ms. Allocated memory is still 250.6MB. Free memory was 219.9MB in the beginning and 204.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 10:22:35,416 INFO L158 Benchmark]: TraceAbstraction took 52284.13ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 203.7MB in the beginning and 265.5MB in the end (delta: -61.8MB). Peak memory consumption was 164.6MB. Max. memory is 8.0GB. [2022-04-27 10:22:35,417 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 176.2MB. Free memory was 134.8MB in the beginning and 134.7MB in the end (delta: 154.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.06ms. Allocated memory was 176.2MB in the beginning and 250.6MB in the end (delta: 74.4MB). Free memory was 118.4MB in the beginning and 222.0MB in the end (delta: -103.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 250.6MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 408.17ms. Allocated memory is still 250.6MB. Free memory was 219.9MB in the beginning and 204.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 52284.13ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 203.7MB in the beginning and 265.5MB in the end (delta: -61.8MB). Peak memory consumption was 164.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_mod_aux_mod_main_~i~0_26_37 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:202) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 10:22:35,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...