/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/vogal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:04:48,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:04:48,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:04:48,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:04:48,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:04:48,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:04:48,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:04:48,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:04:48,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:04:48,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:04:48,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:04:48,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:04:48,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:04:48,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:04:48,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:04:48,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:04:48,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:04:48,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:04:48,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:04:48,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:04:48,736 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:04:48,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:04:48,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:04:48,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:04:48,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:04:48,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:04:48,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:04:48,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:04:48,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:04:48,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:04:48,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:04:48,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:04:48,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:04:48,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:04:48,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:04:48,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:04:48,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:04:48,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:04:48,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:04:48,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:04:48,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:04:48,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:04:48,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:04:48,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:04:48,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:04:48,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:04:48,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:04:48,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:48,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:04:48,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:04:48,765 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:04:48,765 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:04:48,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:04:48,765 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:04:48,765 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 09:04:48,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:04:48,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:04:48,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:04:48,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:04:48,991 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:04:48,992 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-28 09:04:49,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fcadea9b/ce3d6f3fe36a42b18c555f39cef3c72b/FLAG0a6f02797 [2022-04-28 09:04:49,457 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:04:49,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2022-04-28 09:04:49,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fcadea9b/ce3d6f3fe36a42b18c555f39cef3c72b/FLAG0a6f02797 [2022-04-28 09:04:49,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fcadea9b/ce3d6f3fe36a42b18c555f39cef3c72b [2022-04-28 09:04:49,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:04:49,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:04:49,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:49,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:04:49,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:04:49,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:49" (1/1) ... [2022-04-28 09:04:49,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515e7286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:49, skipping insertion in model container [2022-04-28 09:04:49,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:49" (1/1) ... [2022-04-28 09:04:49,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:04:49,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:04:50,053 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-28 09:04:50,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:50,095 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:04:50,105 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-28 09:04:50,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:50,126 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:04:50,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50 WrapperNode [2022-04-28 09:04:50,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:50,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:04:50,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:04:50,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:04:50,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:04:50,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:04:50,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:04:50,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:04:50,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (1/1) ... [2022-04-28 09:04:50,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:50,204 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-28 09:04:50,213 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-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:04:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:04:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:04:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:04:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:04:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:04:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:04:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:04:50,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:04:50,317 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:04:50,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:04:50,578 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:04:50,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:04:50,600 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 09:04:50,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:50 BoogieIcfgContainer [2022-04-28 09:04:50,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:04:50,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:04:50,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:04:50,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:04:50,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:04:49" (1/3) ... [2022-04-28 09:04:50,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff7762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:50, skipping insertion in model container [2022-04-28 09:04:50,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:50" (2/3) ... [2022-04-28 09:04:50,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff7762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:50, skipping insertion in model container [2022-04-28 09:04:50,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:50" (3/3) ... [2022-04-28 09:04:50,608 INFO L111 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2022-04-28 09:04:50,635 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:04:50,636 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:04:50,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:04:50,704 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@7547c1ad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5272630 [2022-04-28 09:04:50,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:04:50,718 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-28 09:04:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:04:50,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:50,726 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-28 09:04:50,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash -366742854, now seen corresponding path program 1 times [2022-04-28 09:04:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [222105199] [2022-04-28 09:04:50,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -366742854, now seen corresponding path program 2 times [2022-04-28 09:04:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488482482] [2022-04-28 09:04:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:51,014 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-28 09:04:51,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 09:04:51,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-28 09:04:51,022 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-28 09:04:51,022 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-28 09:04:51,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 09:04:51,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-28 09:04:51,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2022-04-28 09:04:51,023 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-28 09:04:51,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~i~0 % 4294967296 < 5); {40#true} is VALID [2022-04-28 09:04:51,023 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-28 09:04:51,024 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-28 09:04:51,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-04-28 09:04:51,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} ~cont~0 := 0;~i~0 := 0; {41#false} is VALID [2022-04-28 09:04:51,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {41#false} is VALID [2022-04-28 09:04:51,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~i~0 := 0;~cont_aux~0 := 0; {41#false} is VALID [2022-04-28 09:04:51,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 09:04:51,028 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-28 09:04:51,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 09:04:51,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 09:04:51,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 09:04:51,029 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-28 09:04:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488482482] [2022-04-28 09:04:51,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488482482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:51,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:51,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:51,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [222105199] [2022-04-28 09:04:51,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [222105199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:51,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:51,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:51,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96045071] [2022-04-28 09:04:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:51,039 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-28 09:04:51,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:51,043 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-28 09:04:51,070 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-28 09:04:51,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:04:51,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:04:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:04:51,100 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-28 09:04:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,242 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-28 09:04:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:04:51,243 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-28 09:04:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:51,244 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-28 09:04:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 09:04:51,260 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-28 09:04:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 09:04:51,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 09:04:51,367 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-28 09:04:51,377 INFO L225 Difference]: With dead ends: 66 [2022-04-28 09:04:51,378 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:04:51,380 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-28 09:04:51,384 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-28 09:04:51,386 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-28 09:04:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:04:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 09:04:51,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:51,413 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-28 09:04:51,414 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-28 09:04:51,414 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-28 09:04:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,417 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-28 09:04:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-28 09:04:51,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:51,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:51,418 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-28 09:04:51,418 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-28 09:04:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,420 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-28 09:04:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-28 09:04:51,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:51,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:51,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:51,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:51,421 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-28 09:04:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-28 09:04:51,424 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2022-04-28 09:04:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:51,424 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-28 09:04:51,424 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-28 09:04:51,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-28 09:04:51,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-28 09:04:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 09:04:51,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:51,464 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-28 09:04:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:04:51,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -864138192, now seen corresponding path program 1 times [2022-04-28 09:04:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292709633] [2022-04-28 09:04:51,466 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -864138192, now seen corresponding path program 2 times [2022-04-28 09:04:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:51,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138763950] [2022-04-28 09:04:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:51,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#(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); {300#true} is VALID [2022-04-28 09:04:51,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-28 09:04:51,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #133#return; {300#true} is VALID [2022-04-28 09:04:51,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {300#true} call ULTIMATE.init(); {306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:51,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#(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); {300#true} is VALID [2022-04-28 09:04:51,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-28 09:04:51,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#true} {300#true} #133#return; {300#true} is VALID [2022-04-28 09:04:51,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#true} call #t~ret17 := main(); {300#true} is VALID [2022-04-28 09:04:51,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#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; {305#(= main_~i~0 0)} is VALID [2022-04-28 09:04:51,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 5); {301#false} is VALID [2022-04-28 09:04:51,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {301#false} is VALID [2022-04-28 09:04:51,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {301#false} is VALID [2022-04-28 09:04:51,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {301#false} is VALID [2022-04-28 09:04:51,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#false} assume !(0 != #t~mem4);havoc #t~mem4; {301#false} is VALID [2022-04-28 09:04:51,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#false} ~cont~0 := 0;~i~0 := 0; {301#false} is VALID [2022-04-28 09:04:51,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {301#false} is VALID [2022-04-28 09:04:51,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {301#false} ~i~0 := 0;~cont_aux~0 := 0; {301#false} is VALID [2022-04-28 09:04:51,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {301#false} is VALID [2022-04-28 09:04:51,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {301#false} assume !(0 != #t~mem11);havoc #t~mem11; {301#false} is VALID [2022-04-28 09:04:51,534 INFO L272 TraceCheckUtils]: 16: Hoare triple {301#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {301#false} is VALID [2022-04-28 09:04:51,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {301#false} ~cond := #in~cond; {301#false} is VALID [2022-04-28 09:04:51,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#false} assume 0 == ~cond; {301#false} is VALID [2022-04-28 09:04:51,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {301#false} assume !false; {301#false} is VALID [2022-04-28 09:04:51,535 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-28 09:04:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:51,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138763950] [2022-04-28 09:04:51,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138763950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:51,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:04:51,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292709633] [2022-04-28 09:04:51,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292709633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:51,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:51,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:04:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128669635] [2022-04-28 09:04:51,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:51,559 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-28 09:04:51,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:51,559 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-28 09:04:51,574 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-28 09:04:51,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:04:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:04:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:04:51,576 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-28 09:04:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,729 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-28 09:04:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:04:51,730 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-28 09:04:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:51,730 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-28 09:04:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 09:04:51,732 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-28 09:04:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 09:04:51,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 09:04:51,815 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-28 09:04:51,817 INFO L225 Difference]: With dead ends: 67 [2022-04-28 09:04:51,817 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 09:04:51,817 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-28 09:04:51,818 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:51,819 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.0s Time] [2022-04-28 09:04:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 09:04:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-28 09:04:51,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:51,825 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-28 09:04:51,826 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-28 09:04:51,826 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-28 09:04:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,828 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 09:04:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-28 09:04:51,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:51,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:51,829 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-28 09:04:51,829 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-28 09:04:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:51,832 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 09:04:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-28 09:04:51,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:51,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:51,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:51,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:51,833 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-28 09:04:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-28 09:04:51,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2022-04-28 09:04:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:51,835 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-28 09:04:51,835 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-28 09:04:51,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-28 09:04:51,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 09:04:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 09:04:51,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:51,871 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-28 09:04:51,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:04:51,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:51,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 32041234, now seen corresponding path program 1 times [2022-04-28 09:04:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:51,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397093899] [2022-04-28 09:04:51,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:51,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 32041234, now seen corresponding path program 2 times [2022-04-28 09:04:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:51,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415961506] [2022-04-28 09:04:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:52,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(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); {597#true} is VALID [2022-04-28 09:04:52,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-28 09:04:52,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-28 09:04:52,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:52,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#(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); {597#true} is VALID [2022-04-28 09:04:52,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-28 09:04:52,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-28 09:04:52,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret17 := main(); {597#true} is VALID [2022-04-28 09:04:52,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#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; {602#(= main_~i~0 0)} is VALID [2022-04-28 09:04:52,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {602#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {602#(= main_~i~0 0)} is VALID [2022-04-28 09:04:52,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {602#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {603#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:52,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {598#false} is VALID [2022-04-28 09:04:52,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {598#false} is VALID [2022-04-28 09:04:52,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {598#false} is VALID [2022-04-28 09:04:52,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {598#false} is VALID [2022-04-28 09:04:52,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#false} assume !(0 != #t~mem4);havoc #t~mem4; {598#false} is VALID [2022-04-28 09:04:52,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {598#false} ~cont~0 := 0;~i~0 := 0; {598#false} is VALID [2022-04-28 09:04:52,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {598#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {598#false} is VALID [2022-04-28 09:04:52,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {598#false} ~i~0 := 0;~cont_aux~0 := 0; {598#false} is VALID [2022-04-28 09:04:52,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {598#false} is VALID [2022-04-28 09:04:52,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {598#false} assume !(0 != #t~mem11);havoc #t~mem11; {598#false} is VALID [2022-04-28 09:04:52,018 INFO L272 TraceCheckUtils]: 18: Hoare triple {598#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {598#false} is VALID [2022-04-28 09:04:52,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2022-04-28 09:04:52,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {598#false} assume 0 == ~cond; {598#false} is VALID [2022-04-28 09:04:52,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-28 09:04:52,020 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-28 09:04:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415961506] [2022-04-28 09:04:52,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415961506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657831863] [2022-04-28 09:04:52,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:52,035 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-28 09:04:52,040 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-28 09:04:52,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:52,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:04:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:52,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:52,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2022-04-28 09:04:52,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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); {597#true} is VALID [2022-04-28 09:04:52,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-28 09:04:52,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-28 09:04:52,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret17 := main(); {597#true} is VALID [2022-04-28 09:04:52,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#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; {597#true} is VALID [2022-04-28 09:04:52,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {597#true} is VALID [2022-04-28 09:04:52,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {597#true} is VALID [2022-04-28 09:04:52,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} assume !(~i~0 % 4294967296 < 5); {597#true} is VALID [2022-04-28 09:04:52,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {597#true} is VALID [2022-04-28 09:04:52,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {597#true} is VALID [2022-04-28 09:04:52,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {597#true} is VALID [2022-04-28 09:04:52,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#true} assume !(0 != #t~mem4);havoc #t~mem4; {597#true} is VALID [2022-04-28 09:04:52,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#true} ~cont~0 := 0;~i~0 := 0; {647#(= main_~cont~0 0)} is VALID [2022-04-28 09:04:52,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {647#(= main_~cont~0 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {647#(= main_~cont~0 0)} is VALID [2022-04-28 09:04:52,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {647#(= main_~cont~0 0)} ~i~0 := 0;~cont_aux~0 := 0; {654#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-28 09:04:52,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {654#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {654#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-28 09:04:52,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {654#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} assume !(0 != #t~mem11);havoc #t~mem11; {654#(and (= main_~cont_aux~0 0) (= main_~cont~0 0))} is VALID [2022-04-28 09:04:52,303 INFO L272 TraceCheckUtils]: 18: Hoare triple {654#(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)); {664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:52,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:04:52,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {598#false} is VALID [2022-04-28 09:04:52,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-28 09:04:52,305 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-28 09:04:52,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657831863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:52,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:52,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-28 09:04:52,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:52,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397093899] [2022-04-28 09:04:52,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397093899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:52,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:52,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906456498] [2022-04-28 09:04:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:52,307 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-28 09:04:52,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:52,308 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-28 09:04:52,340 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-28 09:04:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:04:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:04:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:52,342 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-28 09:04:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:52,482 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 09:04:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:04:52,483 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-28 09:04:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:52,483 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-28 09:04:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 09:04:52,485 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-28 09:04:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 09:04:52,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 09:04:52,525 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-28 09:04:52,528 INFO L225 Difference]: With dead ends: 55 [2022-04-28 09:04:52,528 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 09:04:52,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:04:52,532 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-28 09:04:52,536 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-28 09:04:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 09:04:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2022-04-28 09:04:52,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:52,547 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-28 09:04:52,547 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-28 09:04:52,548 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-28 09:04:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:52,550 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 09:04:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-28 09:04:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:52,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:52,554 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-28 09:04:52,554 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-28 09:04:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:52,557 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 09:04:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-28 09:04:52,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:52,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:52,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:52,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:52,558 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-28 09:04:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-28 09:04:52,561 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 22 [2022-04-28 09:04:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:52,562 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-04-28 09:04:52,562 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-28 09:04:52,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2022-04-28 09:04:52,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-04-28 09:04:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 09:04:52,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:52,607 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-28 09:04:52,638 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-28 09:04:52,823 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-28 09:04:52,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1521854123, now seen corresponding path program 1 times [2022-04-28 09:04:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:52,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334375097] [2022-04-28 09:04:52,831 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:52,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1521854123, now seen corresponding path program 2 times [2022-04-28 09:04:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:52,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081604574] [2022-04-28 09:04:52,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:52,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {979#(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); {972#true} is VALID [2022-04-28 09:04:52,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 09:04:52,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-28 09:04:52,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:52,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#(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); {972#true} is VALID [2022-04-28 09:04:52,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 09:04:52,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-28 09:04:52,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret17 := main(); {972#true} is VALID [2022-04-28 09:04:52,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#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; {977#(= main_~i~0 0)} is VALID [2022-04-28 09:04:52,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {977#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {977#(= main_~i~0 0)} is VALID [2022-04-28 09:04:52,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {977#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {978#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {973#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {973#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#false} assume !(0 != #t~mem4);havoc #t~mem4; {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {973#false} ~cont~0 := 0;~i~0 := 0; {973#false} is VALID [2022-04-28 09:04:52,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {973#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {973#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {973#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {973#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {973#false} assume !(~j~0 % 4294967296 < 2); {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {973#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {973#false} is VALID [2022-04-28 09:04:52,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#false} ~i~0 := 0;~cont_aux~0 := 0; {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {973#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {973#false} assume !(0 != #t~mem11);havoc #t~mem11; {973#false} is VALID [2022-04-28 09:04:52,916 INFO L272 TraceCheckUtils]: 24: Hoare triple {973#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {973#false} assume 0 == ~cond; {973#false} is VALID [2022-04-28 09:04:52,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-28 09:04:52,917 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-28 09:04:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081604574] [2022-04-28 09:04:52,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081604574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699197227] [2022-04-28 09:04:52,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:52,918 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-28 09:04:52,919 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-28 09:04:52,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:04:52,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:52,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:04:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:52,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:53,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2022-04-28 09:04:53,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#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); {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 09:04:53,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-28 09:04:53,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret17 := main(); {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#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; {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {972#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(~i~0 % 4294967296 < 5); {972#true} is VALID [2022-04-28 09:04:53,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {972#true} is VALID [2022-04-28 09:04:53,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {972#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1013#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:53,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {1013#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {1013#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:53,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {1013#(= main_~n_caracter~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {1013#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:53,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1013#(= main_~n_caracter~0 0)} ~cont~0 := 0;~i~0 := 0; {1023#(and (= main_~n_caracter~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:04:53,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1023#(and (= main_~n_caracter~0 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {973#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {973#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {973#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {973#false} assume !(~j~0 % 4294967296 < 2); {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {973#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#false} ~i~0 := 0;~cont_aux~0 := 0; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {973#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {973#false} is VALID [2022-04-28 09:04:53,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {973#false} assume !(0 != #t~mem11);havoc #t~mem11; {973#false} is VALID [2022-04-28 09:04:53,084 INFO L272 TraceCheckUtils]: 24: Hoare triple {973#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {973#false} is VALID [2022-04-28 09:04:53,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2022-04-28 09:04:53,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {973#false} assume 0 == ~cond; {973#false} is VALID [2022-04-28 09:04:53,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-28 09:04:53,085 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-28 09:04:53,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:53,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699197227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:53,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:53,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-28 09:04:53,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334375097] [2022-04-28 09:04:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334375097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:04:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697067868] [2022-04-28 09:04:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:53,086 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-28 09:04:53,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:53,087 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-28 09:04:53,104 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-28 09:04:53,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:04:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:04:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:04:53,105 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-28 09:04:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:53,198 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-28 09:04:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:04:53,198 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-28 09:04:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:53,199 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-28 09:04:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-28 09:04:53,200 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-28 09:04:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-28 09:04:53,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-28 09:04:53,243 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-28 09:04:53,244 INFO L225 Difference]: With dead ends: 100 [2022-04-28 09:04:53,244 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 09:04:53,245 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-28 09:04:53,245 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-28 09:04:53,245 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-28 09:04:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 09:04:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2022-04-28 09:04:53,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:53,250 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-28 09:04:53,250 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-28 09:04:53,251 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-28 09:04:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:53,252 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-28 09:04:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-28 09:04:53,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:53,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:53,253 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-28 09:04:53,253 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-28 09:04:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:53,255 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-28 09:04:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-28 09:04:53,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:53,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:53,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:53,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:53,256 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-28 09:04:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-04-28 09:04:53,257 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 28 [2022-04-28 09:04:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:53,257 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-04-28 09:04:53,257 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-28 09:04:53,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 60 transitions. [2022-04-28 09:04:53,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-04-28 09:04:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:04:53,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:53,322 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-28 09:04:53,340 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-28 09:04:53,535 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-28 09:04:53,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2104041838, now seen corresponding path program 1 times [2022-04-28 09:04:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:53,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856494089] [2022-04-28 09:04:53,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:53,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2104041838, now seen corresponding path program 2 times [2022-04-28 09:04:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252806200] [2022-04-28 09:04:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:53,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1508#(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); {1501#true} is VALID [2022-04-28 09:04:53,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 09:04:53,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-28 09:04:53,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:53,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1508#(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); {1501#true} is VALID [2022-04-28 09:04:53,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 09:04:53,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-28 09:04:53,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-28 09:04:53,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#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; {1506#(= main_~i~0 0)} is VALID [2022-04-28 09:04:53,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {1506#(= main_~i~0 0)} is VALID [2022-04-28 09:04:53,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1506#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1507#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:53,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1507#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {1502#false} is VALID [2022-04-28 09:04:53,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1502#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {1502#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1502#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {1502#false} assume !(0 != #t~mem4);havoc #t~mem4; {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {1502#false} ~cont~0 := 0;~i~0 := 0; {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {1502#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1502#false} is VALID [2022-04-28 09:04:53,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1502#false} ~i~0 := 0;~cont_aux~0 := 0; {1502#false} is VALID [2022-04-28 09:04:53,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {1502#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {1502#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1502#false} is VALID [2022-04-28 09:04:53,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {1502#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {1502#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; {1502#false} is VALID [2022-04-28 09:04:53,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {1502#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1502#false} is VALID [2022-04-28 09:04:53,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-28 09:04:53,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {1502#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1502#false} is VALID [2022-04-28 09:04:53,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-28 09:04:53,664 INFO L272 TraceCheckUtils]: 25: Hoare triple {1502#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1502#false} is VALID [2022-04-28 09:04:53,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-28 09:04:53,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-28 09:04:53,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-28 09:04:53,667 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-28 09:04:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252806200] [2022-04-28 09:04:53,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252806200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911729727] [2022-04-28 09:04:53,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:53,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:53,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:53,669 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-28 09:04:53,670 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-28 09:04:53,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:04:53,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:53,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:04:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:53,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:53,789 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-28 09:04:53,919 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-28 09:04:53,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2022-04-28 09:04:53,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#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); {1501#true} is VALID [2022-04-28 09:04:53,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 09:04:53,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-28 09:04:53,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-28 09:04:53,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#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; {1527#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:04:53,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {1531#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:53,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:53,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {1531#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:53,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1531#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:53,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {1531#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1544#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:04:53,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1544#(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 + ~n_caracter~0 % 4294967296, 1); {1548#(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-28 09:04:53,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#(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; {1552#(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-28 09:04:53,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {1552#(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; {1552#(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-28 09:04:53,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(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); {1552#(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-28 09:04:53,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1552#(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; {1562#(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-28 09:04:53,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1562#(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 + ~i~0 % 4294967296, 1); {1566#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:04:53,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {1566#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1502#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1502#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; {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {1502#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {1502#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:53,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-28 09:04:53,953 INFO L272 TraceCheckUtils]: 25: Hoare triple {1502#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1502#false} is VALID [2022-04-28 09:04:53,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-28 09:04:53,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-28 09:04:53,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-28 09:04:53,953 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-28 09:04:53,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:54,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L272 TraceCheckUtils]: 25: Hoare triple {1502#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {1502#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {1502#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {1502#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; {1502#false} is VALID [2022-04-28 09:04:54,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {1502#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {1502#false} is VALID [2022-04-28 09:04:54,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1566#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1502#false} is VALID [2022-04-28 09:04:54,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#(= (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 + ~i~0 % 4294967296, 1); {1566#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:04:54,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} ~i~0 := 0;~cont_aux~0 := 0; {1639#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0)} is VALID [2022-04-28 09:04:54,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-28 09:04:54,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} ~cont~0 := 0;~i~0 := 0; {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-28 09:04:54,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {1653#(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; {1643#(= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)} is VALID [2022-04-28 09:04:54,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {1657#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {1653#(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-28 09:04:54,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {1501#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1657#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0) (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296))))))} is VALID [2022-04-28 09:04:54,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1501#true} is VALID [2022-04-28 09:04:54,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#true} assume !(~i~0 % 4294967296 < 5); {1501#true} is VALID [2022-04-28 09:04:54,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1501#true} is VALID [2022-04-28 09:04:54,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {1501#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {1501#true} is VALID [2022-04-28 09:04:54,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#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; {1501#true} is VALID [2022-04-28 09:04:54,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-28 09:04:54,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-28 09:04:54,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 09:04:54,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#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); {1501#true} is VALID [2022-04-28 09:04:54,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2022-04-28 09:04:54,104 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-28 09:04:54,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911729727] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:54,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:04:54,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-28 09:04:54,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856494089] [2022-04-28 09:04:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856494089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:54,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:04:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114916156] [2022-04-28 09:04:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:54,105 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-28 09:04:54,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:54,106 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-28 09:04:54,135 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-28 09:04:54,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:04:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:04:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:04:54,136 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-28 09:04:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:54,297 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-28 09:04:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:04:54,297 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-28 09:04:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:54,297 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-28 09:04:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:04:54,299 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-28 09:04:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:04:54,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 09:04:54,328 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-28 09:04:54,329 INFO L225 Difference]: With dead ends: 67 [2022-04-28 09:04:54,329 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 09:04:54,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:04:54,330 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:54,330 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.0s Time] [2022-04-28 09:04:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 09:04:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 09:04:54,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:54,334 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-28 09:04:54,334 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-28 09:04:54,335 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-28 09:04:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:54,336 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-28 09:04:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-28 09:04:54,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:54,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:54,336 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-28 09:04:54,336 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-28 09:04:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:54,337 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-28 09:04:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-28 09:04:54,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:54,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:54,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:54,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:54,337 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-28 09:04:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-28 09:04:54,338 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 29 [2022-04-28 09:04:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:54,339 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-28 09:04:54,339 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-28 09:04:54,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2022-04-28 09:04:54,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-28 09:04:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:04:54,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:54,386 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-28 09:04:54,402 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-28 09:04:54,601 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-28 09:04:54,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 130872262, now seen corresponding path program 1 times [2022-04-28 09:04:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:54,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488380368] [2022-04-28 09:04:54,608 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:54,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 130872262, now seen corresponding path program 2 times [2022-04-28 09:04:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:54,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770556422] [2022-04-28 09:04:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:54,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {2020#(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); {2013#true} is VALID [2022-04-28 09:04:54,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-28 09:04:54,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-28 09:04:54,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {2013#true} call ULTIMATE.init(); {2020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:54,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#(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); {2013#true} is VALID [2022-04-28 09:04:54,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-28 09:04:54,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-28 09:04:54,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-28 09:04:54,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {2013#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; {2018#(= main_~i~0 0)} is VALID [2022-04-28 09:04:54,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {2018#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2018#(= main_~i~0 0)} is VALID [2022-04-28 09:04:54,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2018#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2019#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {2019#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {2014#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {2014#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {2014#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {2014#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {2014#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2014#false} is VALID [2022-04-28 09:04:54,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2014#false} assume !(0 != #t~mem4);havoc #t~mem4; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2014#false} ~cont~0 := 0;~i~0 := 0; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {2014#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {2014#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2014#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {2014#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {2014#false} assume !(~j~0 % 4294967296 < 2); {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {2014#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {2014#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {2014#false} ~i~0 := 0;~cont_aux~0 := 0; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {2014#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {2014#false} assume !(0 != #t~mem11);havoc #t~mem11; {2014#false} is VALID [2022-04-28 09:04:54,689 INFO L272 TraceCheckUtils]: 26: Hoare triple {2014#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2014#false} is VALID [2022-04-28 09:04:54,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-28 09:04:54,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-28 09:04:54,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-28 09:04:54,690 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-28 09:04:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:54,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770556422] [2022-04-28 09:04:54,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770556422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:54,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699174413] [2022-04-28 09:04:54,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:54,696 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-28 09:04:54,728 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-28 09:04:54,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:04:54,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:54,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:04:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:54,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:54,798 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-28 09:04:54,956 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-28 09:04:54,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {2013#true} call ULTIMATE.init(); {2013#true} is VALID [2022-04-28 09:04:54,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#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); {2013#true} is VALID [2022-04-28 09:04:54,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-28 09:04:54,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-28 09:04:54,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-28 09:04:54,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {2013#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; {2039#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:04:54,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {2039#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2043#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:54,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {2043#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2043#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:54,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {2043#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {2043#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:54,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {2043#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2043#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:04:54,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {2043#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2056#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:04:54,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {2056#(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 + ~n_caracter~0 % 4294967296, 1); {2060#(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-28 09:04:54,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {2060#(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; {2064#(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-28 09:04:54,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2064#(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 + ~n_caracter~0 % 4294967296, 1); {2064#(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-28 09:04:54,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {2064#(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; {2064#(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-28 09:04:54,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2064#(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; {2064#(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-28 09:04:54,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {2064#(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; {2064#(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-28 09:04:54,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {2064#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2064#(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-28 09:04:54,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {2064#(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; {2064#(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-28 09:04:54,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {2064#(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; {2064#(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-28 09:04:54,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {2064#(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); {2064#(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-28 09:04:54,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#(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; {2064#(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-28 09:04:54,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {2064#(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); {2064#(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-28 09:04:54,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {2064#(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; {2098#(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-28 09:04:54,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {2098#(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 + ~i~0 % 4294967296, 1); {2102#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:04:54,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {2014#false} is VALID [2022-04-28 09:04:54,980 INFO L272 TraceCheckUtils]: 26: Hoare triple {2014#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2014#false} is VALID [2022-04-28 09:04:54,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-28 09:04:54,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-28 09:04:54,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-28 09:04:54,980 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-28 09:04:54,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:55,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-28 09:04:55,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-28 09:04:55,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-28 09:04:55,088 INFO L272 TraceCheckUtils]: 26: Hoare triple {2014#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2014#false} is VALID [2022-04-28 09:04:55,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {2014#false} is VALID [2022-04-28 09:04:55,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {2133#(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 + ~i~0 % 4294967296, 1); {2102#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:04:55,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} ~i~0 := 0;~cont_aux~0 := 0; {2133#(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-28 09:04:55,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {2137#(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; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(~j~0 % 4294967296 < 2); {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {2137#(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; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {2137#(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; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(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; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} ~cont~0 := 0;~i~0 := 0; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(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 + ~n_caracter~0 % 4294967296, 1); {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2171#(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; {2137#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0))} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {2175#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2171#(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-28 09:04:55,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2013#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2175#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2013#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2013#true} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {2013#true} assume !(~i~0 % 4294967296 < 5); {2013#true} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {2013#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2013#true} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {2013#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2013#true} is VALID [2022-04-28 09:04:55,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {2013#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; {2013#true} is VALID [2022-04-28 09:04:55,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-28 09:04:55,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-28 09:04:55,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-28 09:04:55,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#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); {2013#true} is VALID [2022-04-28 09:04:55,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {2013#true} call ULTIMATE.init(); {2013#true} is VALID [2022-04-28 09:04:55,094 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-28 09:04:55,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699174413] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:55,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:04:55,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-28 09:04:55,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:55,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488380368] [2022-04-28 09:04:55,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488380368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:55,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:55,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:04:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458602736] [2022-04-28 09:04:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:55,095 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-28 09:04:55,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:55,096 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-28 09:04:55,113 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-28 09:04:55,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:04:55,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:04:55,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:04:55,114 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-28 09:04:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:55,315 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-04-28 09:04:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:04:55,315 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-28 09:04:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:55,316 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-28 09:04:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 09:04:55,317 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-28 09:04:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-28 09:04:55,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-28 09:04:55,359 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-28 09:04:55,360 INFO L225 Difference]: With dead ends: 72 [2022-04-28 09:04:55,360 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 09:04:55,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:04:55,361 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:55,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 104 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 09:04:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-28 09:04:55,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:55,366 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-28 09:04:55,367 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-28 09:04:55,367 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-28 09:04:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:55,368 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-28 09:04:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-28 09:04:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:55,368 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-28 09:04:55,369 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-28 09:04:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:55,370 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-28 09:04:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-28 09:04:55,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:55,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:55,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:55,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:55,370 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-28 09:04:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-04-28 09:04:55,371 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2022-04-28 09:04:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:55,371 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-04-28 09:04:55,372 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-28 09:04:55,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2022-04-28 09:04:55,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-28 09:04:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 09:04:55,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:55,437 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-28 09:04:55,454 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-28 09:04:55,651 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-28 09:04:55,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1933277107, now seen corresponding path program 1 times [2022-04-28 09:04:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:55,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404360527] [2022-04-28 09:04:55,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:55,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1933277107, now seen corresponding path program 2 times [2022-04-28 09:04:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:55,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057979956] [2022-04-28 09:04:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:55,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {2596#(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); {2589#true} is VALID [2022-04-28 09:04:55,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:55,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-28 09:04:55,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2596#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:55,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {2596#(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); {2589#true} is VALID [2022-04-28 09:04:55,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:55,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-28 09:04:55,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-28 09:04:55,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#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; {2594#(= main_~i~0 0)} is VALID [2022-04-28 09:04:55,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {2594#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2594#(= main_~i~0 0)} is VALID [2022-04-28 09:04:55,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {2594#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2595#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:55,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {2595#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {2590#false} is VALID [2022-04-28 09:04:55,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {2590#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2590#false} is VALID [2022-04-28 09:04:55,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {2590#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {2590#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {2590#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !(0 != #t~mem4);havoc #t~mem4; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} ~cont~0 := 0;~i~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#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; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-28 09:04:55,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L272 TraceCheckUtils]: 27: Hoare triple {2590#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-28 09:04:55,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 09:04:55,734 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-28 09:04:55,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:55,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057979956] [2022-04-28 09:04:55,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057979956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:55,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103147758] [2022-04-28 09:04:55,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:55,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:55,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:55,736 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-28 09:04:55,765 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-28 09:04:55,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:04:55,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:55,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 09:04:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:55,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:55,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-28 09:04:55,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#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); {2589#true} is VALID [2022-04-28 09:04:55,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:55,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-28 09:04:55,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-28 09:04:55,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#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; {2594#(= main_~i~0 0)} is VALID [2022-04-28 09:04:55,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {2594#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2594#(= main_~i~0 0)} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {2594#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2621#(= main_~i~0 1)} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {2621#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 5); {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2590#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {2590#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {2590#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2590#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !(0 != #t~mem4);havoc #t~mem4; {2590#false} is VALID [2022-04-28 09:04:55,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} ~cont~0 := 0;~i~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#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; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L272 TraceCheckUtils]: 27: Hoare triple {2590#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2590#false} is VALID [2022-04-28 09:04:55,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-28 09:04:55,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-28 09:04:55,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 09:04:55,887 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-28 09:04:55,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L272 TraceCheckUtils]: 27: Hoare triple {2590#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2590#false} is VALID [2022-04-28 09:04:55,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#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; {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {2733#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2590#false} is VALID [2022-04-28 09:04:55,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {2737#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {2733#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:55,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {2737#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {2737#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:55,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {2737#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2737#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2747#(< 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; {2737#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {2747#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2747#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2589#true} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume !(~i~0 % 4294967296 < 5); {2589#true} is VALID [2022-04-28 09:04:55,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#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; {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#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); {2589#true} is VALID [2022-04-28 09:04:55,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-28 09:04:55,981 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-28 09:04:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103147758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:55,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-04-28 09:04:55,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:55,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404360527] [2022-04-28 09:04:55,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404360527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:55,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:04:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490718398] [2022-04-28 09:04:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 31 [2022-04-28 09:04:55,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:55,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-28 09:04:56,000 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-28 09:04:56,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:04:56,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:04:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:56,001 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-28 09:04:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:56,220 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2022-04-28 09:04:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:04:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 31 [2022-04-28 09:04:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-28 09:04:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-04-28 09:04:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-28 09:04:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-04-28 09:04:56,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 106 transitions. [2022-04-28 09:04:56,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:56,296 INFO L225 Difference]: With dead ends: 133 [2022-04-28 09:04:56,296 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 09:04:56,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:04:56,296 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:56,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 40 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 09:04:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 49. [2022-04-28 09:04:56,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:56,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 09:04:56,332 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 09:04:56,332 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 09:04:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:56,334 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-04-28 09:04:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-04-28 09:04:56,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:56,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:56,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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 95 states. [2022-04-28 09:04:56,335 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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 95 states. [2022-04-28 09:04:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:56,336 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-04-28 09:04:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-04-28 09:04:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:56,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:56,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:56,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 09:04:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-04-28 09:04:56,338 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 31 [2022-04-28 09:04:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:56,338 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-04-28 09:04:56,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-28 09:04:56,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 61 transitions. [2022-04-28 09:04:56,396 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-28 09:04:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-04-28 09:04:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 09:04:56,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:56,397 INFO L195 NwaCegarLoop]: trace histogram [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-28 09:04:56,412 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-28 09:04:56,599 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-28 09:04:56,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1557440111, now seen corresponding path program 3 times [2022-04-28 09:04:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:56,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332660302] [2022-04-28 09:04:56,605 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:56,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1557440111, now seen corresponding path program 4 times [2022-04-28 09:04:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:56,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738529130] [2022-04-28 09:04:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:56,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3352#(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); {3344#true} is VALID [2022-04-28 09:04:56,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-28 09:04:56,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-28 09:04:56,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {3344#true} call ULTIMATE.init(); {3352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:56,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3352#(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); {3344#true} is VALID [2022-04-28 09:04:56,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-28 09:04:56,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-28 09:04:56,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-28 09:04:56,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {3344#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; {3349#(= main_~i~0 0)} is VALID [2022-04-28 09:04:56,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {3349#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3349#(= main_~i~0 0)} is VALID [2022-04-28 09:04:56,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {3349#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3350#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:56,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {3350#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3350#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:56,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {3350#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3351#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-28 09:04:56,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {3351#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 5); {3345#false} is VALID [2022-04-28 09:04:56,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {3345#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3345#false} is VALID [2022-04-28 09:04:56,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {3345#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {3345#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {3345#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {3345#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {3345#false} assume !(0 != #t~mem4);havoc #t~mem4; {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {3345#false} ~cont~0 := 0;~i~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {3345#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3345#false} is VALID [2022-04-28 09:04:56,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#false} ~i~0 := 0;~cont_aux~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {3345#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {3345#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {3345#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; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {3345#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {3345#false} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {3345#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {3345#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L272 TraceCheckUtils]: 29: Hoare triple {3345#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-28 09:04:56,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-28 09:04:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 09:04:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:56,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738529130] [2022-04-28 09:04:56,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738529130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:56,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079787891] [2022-04-28 09:04:56,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:04:56,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:56,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:56,679 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-28 09:04:56,680 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-28 09:04:56,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:04:56,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:56,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:04:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:56,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:56,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {3344#true} call ULTIMATE.init(); {3344#true} is VALID [2022-04-28 09:04:56,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3344#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); {3344#true} is VALID [2022-04-28 09:04:56,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-28 09:04:56,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-28 09:04:56,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {3344#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; {3349#(= main_~i~0 0)} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {3349#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3349#(= main_~i~0 0)} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {3349#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {3344#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {3344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < 5); {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {3344#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3344#true} is VALID [2022-04-28 09:04:56,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {3344#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3392#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:56,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {3392#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3392#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:56,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {3392#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3399#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:56,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {3399#(= main_~n_caracter~0 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3399#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {3399#(= main_~n_caracter~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {3399#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {3399#(= main_~n_caracter~0 1)} ~cont~0 := 0;~i~0 := 0; {3409#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {3409#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3345#false} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#false} ~i~0 := 0;~cont_aux~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {3345#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3345#false} is VALID [2022-04-28 09:04:56,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {3345#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {3345#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; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {3345#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {3345#false} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {3345#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {3345#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L272 TraceCheckUtils]: 29: Hoare triple {3345#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-28 09:04:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:04:56,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L272 TraceCheckUtils]: 29: Hoare triple {3345#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {3345#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3345#false} is VALID [2022-04-28 09:04:56,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {3345#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3345#false} is VALID [2022-04-28 09:04:56,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {3476#(< (mod main_~j~0 4294967296) 2)} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-28 09:04:56,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {3480#(< (mod (+ main_~j~0 1) 4294967296) 2)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3476#(< (mod main_~j~0 4294967296) 2)} is VALID [2022-04-28 09:04:56,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {3480#(< (mod (+ main_~j~0 1) 4294967296) 2)} 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; {3480#(< (mod (+ main_~j~0 1) 4294967296) 2)} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {3487#(or (< (mod (+ main_~j~0 1) 4294967296) 2) (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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {3480#(< (mod (+ main_~j~0 1) 4294967296) 2)} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {3344#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3487#(or (< (mod (+ main_~j~0 1) 4294967296) 2) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {3344#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {3344#true} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {3344#true} ~i~0 := 0;~cont_aux~0 := 0; {3344#true} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3344#true} is VALID [2022-04-28 09:04:56,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {3344#true} ~cont~0 := 0;~i~0 := 0; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {3344#true} assume !(0 != #t~mem4);havoc #t~mem4; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {3344#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {3344#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {3344#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3344#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {3344#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < 5); {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {3344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {3344#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {3344#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {3344#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {3344#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; {3344#true} is VALID [2022-04-28 09:04:56,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-28 09:04:56,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-28 09:04:56,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-28 09:04:56,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {3344#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); {3344#true} is VALID [2022-04-28 09:04:56,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {3344#true} call ULTIMATE.init(); {3344#true} is VALID [2022-04-28 09:04:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:04:56,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079787891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:56,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:56,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 12 [2022-04-28 09:04:56,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:56,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332660302] [2022-04-28 09:04:56,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332660302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:56,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:56,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827516882] [2022-04-28 09:04:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 33 [2022-04-28 09:04:56,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:56,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 09:04:56,937 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-28 09:04:56,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:04:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:04:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:04:56,938 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 09:04:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:57,340 INFO L93 Difference]: Finished difference Result 160 states and 215 transitions. [2022-04-28 09:04:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:04:57,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 33 [2022-04-28 09:04:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 09:04:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-04-28 09:04:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 09:04:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-04-28 09:04:57,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2022-04-28 09:04:57,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:57,431 INFO L225 Difference]: With dead ends: 160 [2022-04-28 09:04:57,431 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 09:04:57,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:04:57,432 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 128 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:57,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 55 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 09:04:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 51. [2022-04-28 09:04:57,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:57,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-28 09:04:57,485 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-28 09:04:57,485 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-28 09:04:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:57,490 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-04-28 09:04:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2022-04-28 09:04:57,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:57,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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 122 states. [2022-04-28 09:04:57,491 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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 122 states. [2022-04-28 09:04:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:57,494 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-04-28 09:04:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2022-04-28 09:04:57,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:57,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:57,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:57,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-28 09:04:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-28 09:04:57,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 33 [2022-04-28 09:04:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:57,496 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-28 09:04:57,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 09:04:57,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-28 09:04:57,564 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-28 09:04:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 09:04:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 09:04:57,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:57,564 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] [2022-04-28 09:04:57,583 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-28 09:04:57,775 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-28 09:04:57,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1767228433, now seen corresponding path program 5 times [2022-04-28 09:04:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358161785] [2022-04-28 09:04:57,780 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:57,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1767228433, now seen corresponding path program 6 times [2022-04-28 09:04:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:57,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180565285] [2022-04-28 09:04:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:57,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {4237#(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); {4228#true} is VALID [2022-04-28 09:04:57,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-28 09:04:57,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-28 09:04:57,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} call ULTIMATE.init(); {4237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:57,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4237#(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); {4228#true} is VALID [2022-04-28 09:04:57,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-28 09:04:57,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-28 09:04:57,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-28 09:04:57,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4228#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; {4233#(= main_~i~0 0)} is VALID [2022-04-28 09:04:57,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4233#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4233#(= main_~i~0 0)} is VALID [2022-04-28 09:04:57,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4233#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4234#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:57,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {4234#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4234#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:57,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4234#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4235#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:04:57,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4235#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4235#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:04:57,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {4235#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4236#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {4236#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 3))} assume !(~i~0 % 4294967296 < 5); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {4229#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {4229#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {4229#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {4229#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {4229#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {4229#false} assume !(0 != #t~mem4);havoc #t~mem4; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {4229#false} ~cont~0 := 0;~i~0 := 0; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {4229#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {4229#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:57,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {4229#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; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {4229#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {4229#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L272 TraceCheckUtils]: 31: Hoare triple {4229#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-28 09:04:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 09:04:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:57,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180565285] [2022-04-28 09:04:57,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180565285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:57,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810668334] [2022-04-28 09:04:57,875 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:04:57,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:57,876 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-28 09:04:57,876 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-28 09:04:57,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:04:57,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:57,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:04:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:57,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:58,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} call ULTIMATE.init(); {4228#true} is VALID [2022-04-28 09:04:58,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#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); {4228#true} is VALID [2022-04-28 09:04:58,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-28 09:04:58,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-28 09:04:58,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-28 09:04:58,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {4228#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; {4233#(= main_~i~0 0)} is VALID [2022-04-28 09:04:58,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {4233#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {4228#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {4228#true} assume !(~i~0 % 4294967296 < 5); {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {4228#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {4228#true} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {4228#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4283#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:58,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {4283#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4283#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:58,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {4283#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4290#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:58,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {4290#(= main_~n_caracter~0 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4290#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:58,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {4290#(= main_~n_caracter~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {4290#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {4290#(= main_~n_caracter~0 1)} ~cont~0 := 0;~i~0 := 0; {4300#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {4300#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {4229#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {4229#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; {4229#false} is VALID [2022-04-28 09:04:58,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {4229#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {4229#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L272 TraceCheckUtils]: 31: Hoare triple {4229#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-28 09:04:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 09:04:58,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L272 TraceCheckUtils]: 31: Hoare triple {4229#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {4229#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {4229#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4229#false} is VALID [2022-04-28 09:04:58,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {4229#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; {4229#false} is VALID [2022-04-28 09:04:58,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {4229#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-28 09:04:58,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {4229#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {4229#false} is VALID [2022-04-28 09:04:58,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-28 09:04:58,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {4388#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4229#false} is VALID [2022-04-28 09:04:58,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {4392#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {4388#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:58,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {4392#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {4392#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:58,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {4392#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4392#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:58,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {4402#(< 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; {4392#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:58,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {4402#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {4402#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {4228#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4402#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {4228#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {4228#true} assume !(~i~0 % 4294967296 < 5); {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {4228#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {4228#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {4228#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {4228#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; {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-28 09:04:58,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-28 09:04:58,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-28 09:04:58,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#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); {4228#true} is VALID [2022-04-28 09:04:58,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} call ULTIMATE.init(); {4228#true} is VALID [2022-04-28 09:04:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:04:58,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810668334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:58,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:58,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 13 [2022-04-28 09:04:58,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358161785] [2022-04-28 09:04:58,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358161785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:58,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:58,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:04:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379745032] [2022-04-28 09:04:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 35 [2022-04-28 09:04:58,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:58,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-28 09:04:58,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:58,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:04:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:04:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:04:58,203 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-28 09:04:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:59,002 INFO L93 Difference]: Finished difference Result 187 states and 253 transitions. [2022-04-28 09:04:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:04:59,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 35 [2022-04-28 09:04:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-28 09:04:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 09:04:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-28 09:04:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-28 09:04:59,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-28 09:04:59,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:59,100 INFO L225 Difference]: With dead ends: 187 [2022-04-28 09:04:59,100 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 09:04:59,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:04:59,101 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 176 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:59,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 67 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:04:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 09:04:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 53. [2022-04-28 09:04:59,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:59,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-28 09:04:59,174 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-28 09:04:59,174 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-28 09:04:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:59,177 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-28 09:04:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-28 09:04:59,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:59,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:59,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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 149 states. [2022-04-28 09:04:59,178 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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 149 states. [2022-04-28 09:04:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:59,180 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-28 09:04:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-28 09:04:59,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:59,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:59,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:59,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 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-28 09:04:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-04-28 09:04:59,181 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 35 [2022-04-28 09:04:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:59,181 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-04-28 09:04:59,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-28 09:04:59,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 65 transitions. [2022-04-28 09:04:59,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-04-28 09:04:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 09:04:59,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:59,274 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] [2022-04-28 09:04:59,290 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-28 09:04:59,475 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-28 09:04:59,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1510342963, now seen corresponding path program 7 times [2022-04-28 09:04:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083872236] [2022-04-28 09:04:59,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:59,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1510342963, now seen corresponding path program 8 times [2022-04-28 09:04:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:59,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254999833] [2022-04-28 09:04:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:59,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {5249#(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); {5239#true} is VALID [2022-04-28 09:04:59,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-28 09:04:59,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-28 09:04:59,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {5239#true} call ULTIMATE.init(); {5249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:59,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#(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); {5239#true} is VALID [2022-04-28 09:04:59,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-28 09:04:59,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-28 09:04:59,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-28 09:04:59,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5239#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; {5244#(= main_~i~0 0)} is VALID [2022-04-28 09:04:59,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {5244#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5244#(= main_~i~0 0)} is VALID [2022-04-28 09:04:59,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5245#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:59,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {5245#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5245#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:04:59,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {5245#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5246#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:04:59,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {5246#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5246#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:04:59,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {5246#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5247#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:04:59,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {5247#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5247#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:04:59,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {5247#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5248#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:04:59,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {5248#(and (<= main_~i~0 4) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} assume !(~i~0 % 4294967296 < 5); {5240#false} is VALID [2022-04-28 09:04:59,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {5240#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5240#false} is VALID [2022-04-28 09:04:59,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {5240#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {5240#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {5240#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {5240#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {5240#false} assume !(0 != #t~mem4);havoc #t~mem4; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {5240#false} ~cont~0 := 0;~i~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {5240#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {5240#false} ~i~0 := 0;~cont_aux~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {5240#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {5240#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {5240#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {5240#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; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {5240#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#false} assume !(~j~0 % 4294967296 < 2); {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {5240#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {5240#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {5240#false} assume !(0 != #t~mem11);havoc #t~mem11; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L272 TraceCheckUtils]: 33: Hoare triple {5240#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {5240#false} ~cond := #in~cond; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {5240#false} assume 0 == ~cond; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-28 09:04:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 09:04:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:59,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254999833] [2022-04-28 09:04:59,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254999833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:59,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462049484] [2022-04-28 09:04:59,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:59,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:59,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:59,579 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-28 09:04:59,580 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-28 09:04:59,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:04:59,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:59,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:04:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:59,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {5239#true} call ULTIMATE.init(); {5239#true} is VALID [2022-04-28 09:04:59,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5239#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); {5239#true} is VALID [2022-04-28 09:04:59,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-28 09:04:59,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-28 09:04:59,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {5239#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; {5244#(= main_~i~0 0)} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5244#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5244#(= main_~i~0 0)} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {5244#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#true} assume !(~i~0 % 4294967296 < 5); {5239#true} is VALID [2022-04-28 09:04:59,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5239#true} is VALID [2022-04-28 09:04:59,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5301#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:59,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {5301#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5301#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:04:59,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {5301#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5308#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:59,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#(= main_~n_caracter~0 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5308#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:59,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#(= main_~n_caracter~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {5308#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#(= main_~n_caracter~0 1)} ~cont~0 := 0;~i~0 := 0; {5318#(and (= main_~n_caracter~0 1) (= main_~cont~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {5318#(and (= main_~n_caracter~0 1) (= main_~cont~0 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5240#false} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {5240#false} ~i~0 := 0;~cont_aux~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {5240#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {5240#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5240#false} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {5240#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {5240#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; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {5240#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#false} assume !(~j~0 % 4294967296 < 2); {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {5240#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {5240#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {5240#false} assume !(0 != #t~mem11);havoc #t~mem11; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L272 TraceCheckUtils]: 33: Hoare triple {5240#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {5240#false} ~cond := #in~cond; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {5240#false} assume 0 == ~cond; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-28 09:04:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:04:59,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:59,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-28 09:04:59,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {5367#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5240#false} is VALID [2022-04-28 09:04:59,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {5371#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5367#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:04:59,976 INFO L272 TraceCheckUtils]: 33: Hoare triple {5375#(= (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)); {5371#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:59,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(0 != #t~mem11);havoc #t~mem11; {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {5394#(= (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; {5375#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {5394#(= (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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {5394#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {5394#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5394#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {5394#(= (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 + ~i~0 % 4294967296, 1); {5394#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {5407#(= (mod main_~cont~0 4294967296) 1)} ~i~0 := 0;~cont_aux~0 := 0; {5394#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:04:59,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {5411#(or (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= (mod main_~cont~0 4294967296) 1))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5407#(= (mod main_~cont~0 4294967296) 1)} is VALID [2022-04-28 09:04:59,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {5415#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {5411#(or (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= (mod main_~cont~0 4294967296) 1))} is VALID [2022-04-28 09:04:59,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {5415#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {5415#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:59,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {5415#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5415#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {5425#(< 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; {5415#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {5425#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {5425#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {5239#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5425#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {5239#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5239#true} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#true} assume !(~i~0 % 4294967296 < 5); {5239#true} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {5239#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {5239#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {5239#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; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {5239#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); {5239#true} is VALID [2022-04-28 09:04:59,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {5239#true} call ULTIMATE.init(); {5239#true} is VALID [2022-04-28 09:04:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 09:04:59,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462049484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:59,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:59,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 10] total 19 [2022-04-28 09:04:59,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083872236] [2022-04-28 09:04:59,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083872236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:59,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:59,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:04:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645016767] [2022-04-28 09:04:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 37 [2022-04-28 09:04:59,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:59,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-28 09:05:00,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:00,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:05:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:00,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:05:00,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:05:00,018 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-28 09:05:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:01,116 INFO L93 Difference]: Finished difference Result 214 states and 291 transitions. [2022-04-28 09:05:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:05:01,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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 37 [2022-04-28 09:05:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-28 09:05:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-04-28 09:05:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-28 09:05:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-04-28 09:05:01,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 169 transitions. [2022-04-28 09:05:01,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:01,246 INFO L225 Difference]: With dead ends: 214 [2022-04-28 09:05:01,246 INFO L226 Difference]: Without dead ends: 176 [2022-04-28 09:05:01,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:05:01,248 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 223 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:01,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 79 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:05:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-28 09:05:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 55. [2022-04-28 09:05:01,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:01,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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-28 09:05:01,362 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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-28 09:05:01,362 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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-28 09:05:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:01,366 INFO L93 Difference]: Finished difference Result 176 states and 241 transitions. [2022-04-28 09:05:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 241 transitions. [2022-04-28 09:05:01,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:01,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:01,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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 176 states. [2022-04-28 09:05:01,367 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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 176 states. [2022-04-28 09:05:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:01,371 INFO L93 Difference]: Finished difference Result 176 states and 241 transitions. [2022-04-28 09:05:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 241 transitions. [2022-04-28 09:05:01,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:01,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:01,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:01,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 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-28 09:05:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-04-28 09:05:01,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 37 [2022-04-28 09:05:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:01,373 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-04-28 09:05:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 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-28 09:05:01,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 67 transitions. [2022-04-28 09:05:01,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-28 09:05:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 09:05:01,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:01,459 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] [2022-04-28 09:05:01,495 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-28 09:05:01,667 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-28 09:05:01,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 543457835, now seen corresponding path program 9 times [2022-04-28 09:05:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049054662] [2022-04-28 09:05:01,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:01,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 543457835, now seen corresponding path program 10 times [2022-04-28 09:05:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:01,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287496910] [2022-04-28 09:05:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:01,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {6389#(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); {6382#true} is VALID [2022-04-28 09:05:01,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-28 09:05:01,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {6382#true} call ULTIMATE.init(); {6389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {6389#(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); {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {6382#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; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {6382#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {6382#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {6382#true} assume !(0 != #t~mem4);havoc #t~mem4; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {6382#true} ~cont~0 := 0;~i~0 := 0; {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6382#true} is VALID [2022-04-28 09:05:01,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {6382#true} ~i~0 := 0;~cont_aux~0 := 0; {6382#true} is VALID [2022-04-28 09:05:01,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {6382#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:01,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {6382#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {6387#(= main_~j~0 0)} is VALID [2022-04-28 09:05:01,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {6387#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {6387#(= main_~j~0 0)} is VALID [2022-04-28 09:05:01,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {6387#(= main_~j~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; {6387#(= main_~j~0 0)} is VALID [2022-04-28 09:05:01,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {6387#(= main_~j~0 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {6388#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-28 09:05:01,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {6388#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < 2); {6383#false} is VALID [2022-04-28 09:05:01,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {6383#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6383#false} is VALID [2022-04-28 09:05:01,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {6383#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6383#false} is VALID [2022-04-28 09:05:01,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-28 09:05:01,762 INFO L272 TraceCheckUtils]: 35: Hoare triple {6383#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {6383#false} is VALID [2022-04-28 09:05:01,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-28 09:05:01,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-28 09:05:01,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-28 09:05:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287496910] [2022-04-28 09:05:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287496910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108389949] [2022-04-28 09:05:01,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:05:01,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:01,763 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-28 09:05:01,764 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-28 09:05:01,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:05:01,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:01,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:05:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:01,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:01,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {6382#true} call ULTIMATE.init(); {6382#true} is VALID [2022-04-28 09:05:01,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {6382#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); {6382#true} is VALID [2022-04-28 09:05:01,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-28 09:05:01,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-28 09:05:01,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {6382#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; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-28 09:05:01,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {6382#true} is VALID [2022-04-28 09:05:01,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {6447#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:01,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {6447#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6447#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:01,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {6447#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {6454#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:05:01,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {6454#(= main_~n_caracter~0 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6454#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:05:01,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {6454#(= main_~n_caracter~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {6454#(= main_~n_caracter~0 1)} is VALID [2022-04-28 09:05:01,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {6454#(= main_~n_caracter~0 1)} ~cont~0 := 0;~i~0 := 0; {6464#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {6464#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {6383#false} ~i~0 := 0;~cont_aux~0 := 0; {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {6383#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {6383#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {6383#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {6383#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; {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {6383#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {6383#false} assume !(~j~0 % 4294967296 < 2); {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {6383#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6383#false} is VALID [2022-04-28 09:05:01,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {6383#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L272 TraceCheckUtils]: 35: Hoare triple {6383#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-28 09:05:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 09:05:01,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L272 TraceCheckUtils]: 35: Hoare triple {6383#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {6383#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6383#false} is VALID [2022-04-28 09:05:02,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {6383#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {6383#false} is VALID [2022-04-28 09:05:02,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {6531#(< (mod main_~j~0 4294967296) 2)} assume !(~j~0 % 4294967296 < 2); {6383#false} is VALID [2022-04-28 09:05:02,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {6535#(< (mod (+ main_~j~0 1) 4294967296) 2)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {6531#(< (mod main_~j~0 4294967296) 2)} is VALID [2022-04-28 09:05:02,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {6535#(< (mod (+ main_~j~0 1) 4294967296) 2)} 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; {6535#(< (mod (+ main_~j~0 1) 4294967296) 2)} is VALID [2022-04-28 09:05:02,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {6542#(or (< (mod (+ main_~j~0 1) 4294967296) 2) (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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {6535#(< (mod (+ main_~j~0 1) 4294967296) 2)} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {6382#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {6542#(or (< (mod (+ main_~j~0 1) 4294967296) 2) (not (< (mod main_~j~0 4294967296) 2)))} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {6382#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {6382#true} ~i~0 := 0;~cont_aux~0 := 0; {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {6382#true} ~cont~0 := 0;~i~0 := 0; {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {6382#true} assume !(0 != #t~mem4);havoc #t~mem4; {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {6382#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {6382#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {6382#true} is VALID [2022-04-28 09:05:02,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:02,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:02,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {6382#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6382#true} is VALID [2022-04-28 09:05:02,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {6382#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {6382#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; {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6382#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); {6382#true} is VALID [2022-04-28 09:05:02,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {6382#true} call ULTIMATE.init(); {6382#true} is VALID [2022-04-28 09:05:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:02,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108389949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:02,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:02,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-28 09:05:02,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:02,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049054662] [2022-04-28 09:05:02,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049054662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:02,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:02,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:05:02,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140705682] [2022-04-28 09:05:02,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 39 [2022-04-28 09:05:02,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:02,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-28 09:05:02,061 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-28 09:05:02,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:05:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:05:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 09:05:02,061 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-28 09:05:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:02,430 INFO L93 Difference]: Finished difference Result 110 states and 148 transitions. [2022-04-28 09:05:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:05:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 39 [2022-04-28 09:05:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-28 09:05:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-28 09:05:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-28 09:05:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-28 09:05:02,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-04-28 09:05:02,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:02,501 INFO L225 Difference]: With dead ends: 110 [2022-04-28 09:05:02,501 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 09:05:02,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:05:02,501 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 59 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:05:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 09:05:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-28 09:05:02,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:02,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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-28 09:05:02,676 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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-28 09:05:02,676 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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-28 09:05:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:02,677 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-04-28 09:05:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-04-28 09:05:02,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:02,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:02,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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 79 states. [2022-04-28 09:05:02,678 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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 79 states. [2022-04-28 09:05:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:02,679 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-04-28 09:05:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-04-28 09:05:02,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:02,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:02,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:02,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 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-28 09:05:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2022-04-28 09:05:02,680 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 39 [2022-04-28 09:05:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2022-04-28 09:05:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-28 09:05:02,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 87 transitions. [2022-04-28 09:05:02,803 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-28 09:05:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-28 09:05:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:05:02,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:02,803 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:05:02,819 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-28 09:05:03,003 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-28 09:05:03,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash -334288281, now seen corresponding path program 11 times [2022-04-28 09:05:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:03,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814984001] [2022-04-28 09:05:03,008 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:03,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -334288281, now seen corresponding path program 12 times [2022-04-28 09:05:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:03,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987330273] [2022-04-28 09:05:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:03,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {7162#(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); {7153#true} is VALID [2022-04-28 09:05:03,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-28 09:05:03,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-28 09:05:03,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {7153#true} call ULTIMATE.init(); {7162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:03,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7162#(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); {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {7153#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; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-28 09:05:03,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7153#true} is VALID [2022-04-28 09:05:03,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {7153#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7158#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:03,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {7158#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7158#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:03,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {7158#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7160#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {7160#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {7160#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {7160#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {7161#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {7161#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 1 main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-28 09:05:03,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {7154#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L272 TraceCheckUtils]: 38: Hoare triple {7154#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-28 09:05:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:03,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987330273] [2022-04-28 09:05:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987330273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170034739] [2022-04-28 09:05:03,125 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:05:03,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:03,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:03,126 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-28 09:05:03,128 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-28 09:05:03,212 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:05:03,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:03,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:05:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:03,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:03,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {7153#true} call ULTIMATE.init(); {7153#true} is VALID [2022-04-28 09:05:03,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#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); {7153#true} is VALID [2022-04-28 09:05:03,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-28 09:05:03,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {7153#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; {7181#(= main_~i~0 0)} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {7181#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-28 09:05:03,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7153#true} is VALID [2022-04-28 09:05:03,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {7153#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7158#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:03,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {7158#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7158#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:03,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {7158#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {7159#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {7236#(and (<= main_~n_caracter~0 1) (= main_~i~0 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {7236#(and (<= main_~n_caracter~0 1) (= main_~i~0 0) (<= 1 main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7154#false} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {7154#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L272 TraceCheckUtils]: 38: Hoare triple {7154#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-28 09:05:03,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-28 09:05:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:03,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:03,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-28 09:05:03,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-28 09:05:03,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L272 TraceCheckUtils]: 38: Hoare triple {7154#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {7154#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {7154#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {7154#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; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {7154#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {7154#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {7154#false} is VALID [2022-04-28 09:05:03,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-28 09:05:03,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {7342#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7154#false} is VALID [2022-04-28 09:05:03,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {7346#(< 0 (mod main_~n_caracter~0 4294967296))} ~cont~0 := 0;~i~0 := 0; {7342#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:05:03,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {7346#(< 0 (mod main_~n_caracter~0 4294967296))} assume !(0 != #t~mem4);havoc #t~mem4; {7346#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:05:03,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {7346#(< 0 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7346#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:05:03,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {7356#(< 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; {7346#(< 0 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {7356#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {7356#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {7153#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7356#(< 0 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {7153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {7153#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {7153#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; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#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); {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {7153#true} call ULTIMATE.init(); {7153#true} is VALID [2022-04-28 09:05:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:03,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170034739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:03,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:03,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2022-04-28 09:05:03,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:03,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814984001] [2022-04-28 09:05:03,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814984001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:03,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:03,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:05:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998131527] [2022-04-28 09:05:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 42 [2022-04-28 09:05:03,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:03,586 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), 6 states have internal predecessors, (26), 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-28 09:05:03,603 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-28 09:05:03,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:05:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:05:03,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:05:03,604 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-28 09:05:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:04,950 INFO L93 Difference]: Finished difference Result 255 states and 333 transitions. [2022-04-28 09:05:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:05:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 42 [2022-04-28 09:05:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-28 09:05:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-28 09:05:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-28 09:05:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-28 09:05:04,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-28 09:05:05,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:05,058 INFO L225 Difference]: With dead ends: 255 [2022-04-28 09:05:05,058 INFO L226 Difference]: Without dead ends: 229 [2022-04-28 09:05:05,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:05:05,059 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 129 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:05,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 62 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:05:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-28 09:05:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 77. [2022-04-28 09:05:05,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:05,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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-28 09:05:05,306 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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-28 09:05:05,306 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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-28 09:05:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:05,309 INFO L93 Difference]: Finished difference Result 229 states and 299 transitions. [2022-04-28 09:05:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2022-04-28 09:05:05,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:05,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:05,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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 229 states. [2022-04-28 09:05:05,310 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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 229 states. [2022-04-28 09:05:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:05,313 INFO L93 Difference]: Finished difference Result 229 states and 299 transitions. [2022-04-28 09:05:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2022-04-28 09:05:05,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:05,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:05,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:05,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 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-28 09:05:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2022-04-28 09:05:05,315 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 42 [2022-04-28 09:05:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:05,315 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2022-04-28 09:05:05,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-28 09:05:05,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 95 transitions. [2022-04-28 09:05:05,483 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-28 09:05:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-04-28 09:05:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 09:05:05,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:05,484 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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] [2022-04-28 09:05:05,500 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-28 09:05:05,699 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-28 09:05:05,699 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688413, now seen corresponding path program 13 times [2022-04-28 09:05:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:05,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138056534] [2022-04-28 09:05:05,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:05,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688413, now seen corresponding path program 14 times [2022-04-28 09:05:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:05,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566533874] [2022-04-28 09:05:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:05,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {8561#(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); {8551#true} is VALID [2022-04-28 09:05:05,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-28 09:05:05,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-28 09:05:05,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {8551#true} call ULTIMATE.init(); {8561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {8561#(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); {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {8551#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; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:05,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:05,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:05,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:05,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:05,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {8551#true} assume !(~i~0 % 4294967296 < 5); {8551#true} is VALID [2022-04-28 09:05:05,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {8551#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {8551#true} is VALID [2022-04-28 09:05:05,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {8551#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {8556#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:05,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {8556#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8556#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:05,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {8556#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8557#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {8557#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8557#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {8557#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8558#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:05,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {8558#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8558#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:05,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {8558#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {8559#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 3 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {8560#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {8560#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {8552#false} ~i~0 := 0;~cont_aux~0 := 0; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {8552#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {8552#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {8552#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {8552#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; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {8552#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {8552#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {8552#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; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {8552#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {8552#false} assume !(~j~0 % 4294967296 < 2); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {8552#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {8552#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {8552#false} is VALID [2022-04-28 09:05:05,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {8552#false} assume !(0 != #t~mem11);havoc #t~mem11; {8552#false} is VALID [2022-04-28 09:05:05,827 INFO L272 TraceCheckUtils]: 42: Hoare triple {8552#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {8552#false} is VALID [2022-04-28 09:05:05,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-28 09:05:05,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-28 09:05:05,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-28 09:05:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566533874] [2022-04-28 09:05:05,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566533874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:05,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24788189] [2022-04-28 09:05:05,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:05,828 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-28 09:05:05,829 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-28 09:05:05,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:05,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:05,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:05:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:05,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:06,186 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-28 09:05:06,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {8551#true} call ULTIMATE.init(); {8551#true} is VALID [2022-04-28 09:05:06,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#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); {8551#true} is VALID [2022-04-28 09:05:06,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-28 09:05:06,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-28 09:05:06,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-28 09:05:06,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {8551#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; {8580#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {8580#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8580#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {8580#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {8587#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {8587#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {8587#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {8587#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {8587#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:06,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {8587#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {8621#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {8621#(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 + ~n_caracter~0 % 4294967296, 1); {8621#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {8621#(and (= main_~n_caracter~0 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; {8628#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8632#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} is VALID [2022-04-28 09:05:06,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {8632#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {8636#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:06,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {8658#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8689#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:06,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {8689#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {8693#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:05:06,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {8693#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {8552#false} is VALID [2022-04-28 09:05:06,215 INFO L272 TraceCheckUtils]: 42: Hoare triple {8552#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {8552#false} is VALID [2022-04-28 09:05:06,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-28 09:05:06,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-28 09:05:06,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-28 09:05:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 09:05:06,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:06,375 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:05:06,375 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 22 treesize of output 13 [2022-04-28 09:05:06,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-28 09:05:06,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-28 09:05:06,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-28 09:05:06,453 INFO L272 TraceCheckUtils]: 42: Hoare triple {8552#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {8552#false} is VALID [2022-04-28 09:05:06,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {8693#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {8552#false} is VALID [2022-04-28 09:05:06,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {8724#(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 + ~i~0 % 4294967296, 1); {8693#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:05:06,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {8724#(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-28 09:05:06,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {8728#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:06,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~cont~0 := 0;~i~0 := 0; {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {8781#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {8759#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:06,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {8785#(= (mod main_~n_caracter~0 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8781#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:05:06,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {8789#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {8785#(= (mod main_~n_caracter~0 4294967296) 1)} is VALID [2022-04-28 09:05:06,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {8789#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {8789#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:05:06,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {8551#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {8789#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {8551#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {8551#true} assume !(~i~0 % 4294967296 < 5); {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {8551#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {8551#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {8551#true} is VALID [2022-04-28 09:05:06,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {8551#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; {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#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); {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {8551#true} call ULTIMATE.init(); {8551#true} is VALID [2022-04-28 09:05:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:06,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24788189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:06,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:06,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 23 [2022-04-28 09:05:06,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:06,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138056534] [2022-04-28 09:05:06,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138056534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:06,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:06,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:05:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306660497] [2022-04-28 09:05:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 46 [2022-04-28 09:05:06,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:06,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-28 09:05:06,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:06,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:05:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:05:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:05:06,490 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-28 09:05:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:08,343 INFO L93 Difference]: Finished difference Result 270 states and 352 transitions. [2022-04-28 09:05:08,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:05:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 46 [2022-04-28 09:05:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-28 09:05:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-04-28 09:05:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-28 09:05:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-04-28 09:05:08,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 138 transitions. [2022-04-28 09:05:08,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:08,456 INFO L225 Difference]: With dead ends: 270 [2022-04-28 09:05:08,456 INFO L226 Difference]: Without dead ends: 244 [2022-04-28 09:05:08,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:05:08,457 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 132 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:08,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 105 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:05:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-28 09:05:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 79. [2022-04-28 09:05:08,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:08,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-28 09:05:08,767 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-28 09:05:08,767 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-28 09:05:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:08,783 INFO L93 Difference]: Finished difference Result 244 states and 319 transitions. [2022-04-28 09:05:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2022-04-28 09:05:08,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:08,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:08,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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 244 states. [2022-04-28 09:05:08,785 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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 244 states. [2022-04-28 09:05:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:08,789 INFO L93 Difference]: Finished difference Result 244 states and 319 transitions. [2022-04-28 09:05:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2022-04-28 09:05:08,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:08,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:08,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:08,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-28 09:05:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2022-04-28 09:05:08,791 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 46 [2022-04-28 09:05:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:08,791 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2022-04-28 09:05:08,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-28 09:05:08,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 98 transitions. [2022-04-28 09:05:08,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 09:05:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 09:05:08,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:08,996 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:05:09,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:09,197 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-28 09:05:09,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:09,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1875303096, now seen corresponding path program 15 times [2022-04-28 09:05:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:09,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778568225] [2022-04-28 09:05:09,202 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:09,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1875303096, now seen corresponding path program 16 times [2022-04-28 09:05:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:09,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728512905] [2022-04-28 09:05:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:09,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#(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); {10048#true} is VALID [2022-04-28 09:05:09,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10059#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:09,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#(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); {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-28 09:05:09,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#true} assume !(~i~0 % 4294967296 < 5); {10048#true} is VALID [2022-04-28 09:05:09,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {10048#true} is VALID [2022-04-28 09:05:09,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {10053#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:09,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {10053#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10053#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:09,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {10053#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10054#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:09,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {10054#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10054#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:09,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {10054#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10055#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:09,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {10055#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10055#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:09,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {10055#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10056#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:09,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {10056#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10056#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:09,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {10056#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2022-04-28 09:05:09,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2022-04-28 09:05:09,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {10057#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {10058#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {10058#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {10049#false} ~i~0 := 0;~cont_aux~0 := 0; {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {10049#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {10049#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {10049#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {10049#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; {10049#false} is VALID [2022-04-28 09:05:09,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {10049#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {10049#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {10049#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; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {10049#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {10049#false} assume !(~j~0 % 4294967296 < 2); {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {10049#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {10049#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {10049#false} assume !(0 != #t~mem11);havoc #t~mem11; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L272 TraceCheckUtils]: 44: Hoare triple {10049#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-28 09:05:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:09,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728512905] [2022-04-28 09:05:09,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728512905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:09,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129978040] [2022-04-28 09:05:09,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:05:09,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:09,336 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-28 09:05:09,365 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-28 09:05:09,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:05:09,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:09,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:05:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:09,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:09,674 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-28 09:05:09,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-28 09:05:09,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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); {10048#true} is VALID [2022-04-28 09:05:09,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 09:05:09,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-28 09:05:09,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-28 09:05:09,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {10078#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {10078#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {10078#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {10078#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {10078#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {10078#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:09,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {10078#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {10118#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {10118#(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 + ~n_caracter~0 % 4294967296, 1); {10118#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {10118#(and (= main_~n_caracter~0 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; {10125#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {10125#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10129#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} is VALID [2022-04-28 09:05:09,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {10129#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:09,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {10133#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:09,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {10161#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10192#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:05:09,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {10192#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {10196#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:05:09,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {10196#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {10049#false} is VALID [2022-04-28 09:05:09,704 INFO L272 TraceCheckUtils]: 44: Hoare triple {10049#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {10049#false} is VALID [2022-04-28 09:05:09,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-28 09:05:09,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-28 09:05:09,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-28 09:05:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:05:09,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:09,856 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:05:09,856 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 22 treesize of output 13 [2022-04-28 09:05:09,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-28 09:05:09,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-28 09:05:09,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-28 09:05:09,942 INFO L272 TraceCheckUtils]: 44: Hoare triple {10049#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {10049#false} is VALID [2022-04-28 09:05:09,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {10196#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {10049#false} is VALID [2022-04-28 09:05:09,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {10227#(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 + ~i~0 % 4294967296, 1); {10196#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:05:09,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {10227#(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-28 09:05:09,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {10231#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:05:09,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~cont~0 := 0;~i~0 := 0; {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {10290#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {10262#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:05:09,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {10294#(= (mod main_~n_caracter~0 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10290#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:05:09,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {10298#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {10294#(= (mod main_~n_caracter~0 4294967296) 1)} is VALID [2022-04-28 09:05:09,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {10298#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {10298#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:05:09,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {10298#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#true} assume !(~i~0 % 4294967296 < 5); {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10048#true} is VALID [2022-04-28 09:05:09,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-28 09:05:09,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-28 09:05:09,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 09:05:09,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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); {10048#true} is VALID [2022-04-28 09:05:09,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-28 09:05:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:05:09,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129978040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:09,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:09,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2022-04-28 09:05:09,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:09,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778568225] [2022-04-28 09:05:09,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778568225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:09,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:09,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:05:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656889069] [2022-04-28 09:05:09,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 48 [2022-04-28 09:05:09,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:09,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-28 09:05:09,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:05:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:05:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:05:09,988 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-28 09:05:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:12,367 INFO L93 Difference]: Finished difference Result 317 states and 415 transitions. [2022-04-28 09:05:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:05:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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 48 [2022-04-28 09:05:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-28 09:05:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-04-28 09:05:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-28 09:05:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-04-28 09:05:12,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 161 transitions. [2022-04-28 09:05:12,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:12,513 INFO L225 Difference]: With dead ends: 317 [2022-04-28 09:05:12,513 INFO L226 Difference]: Without dead ends: 291 [2022-04-28 09:05:12,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:05:12,514 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 176 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:12,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 124 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:05:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-28 09:05:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 81. [2022-04-28 09:05:12,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:12,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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-28 09:05:12,861 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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-28 09:05:12,861 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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-28 09:05:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:12,865 INFO L93 Difference]: Finished difference Result 291 states and 382 transitions. [2022-04-28 09:05:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2022-04-28 09:05:12,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:12,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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 291 states. [2022-04-28 09:05:12,866 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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 291 states. [2022-04-28 09:05:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:12,870 INFO L93 Difference]: Finished difference Result 291 states and 382 transitions. [2022-04-28 09:05:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2022-04-28 09:05:12,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:12,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:12,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:12,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 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-28 09:05:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2022-04-28 09:05:12,872 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 48 [2022-04-28 09:05:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:12,872 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2022-04-28 09:05:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-28 09:05:12,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 101 transitions. [2022-04-28 09:05:13,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2022-04-28 09:05:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 09:05:13,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:13,062 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:05:13,078 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-28 09:05:13,262 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-28 09:05:13,262 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:13,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1941482157, now seen corresponding path program 17 times [2022-04-28 09:05:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:13,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411014154] [2022-04-28 09:05:13,267 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:13,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1941482157, now seen corresponding path program 18 times [2022-04-28 09:05:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:13,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097187663] [2022-04-28 09:05:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:13,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {11763#(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); {11751#true} is VALID [2022-04-28 09:05:13,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-28 09:05:13,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {11763#(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); {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {11751#true} call #t~ret17 := main(); {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {11751#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; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {11751#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {11751#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11751#true} is VALID [2022-04-28 09:05:13,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {11751#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {11751#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {11751#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {11751#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {11751#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {11751#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {11751#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {11751#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {11751#true} assume !(~i~0 % 4294967296 < 5); {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {11751#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {11751#true} is VALID [2022-04-28 09:05:13,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {11751#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {11756#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:13,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {11756#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11756#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:05:13,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {11756#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11757#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {11757#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11757#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {11757#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11758#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:13,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {11758#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11758#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:05:13,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {11758#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11759#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {11759#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11759#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {11759#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11760#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:05:13,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {11760#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11760#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:05:13,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {11760#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {11761#(and (<= (div main_~n_caracter~0 4294967296) 0) (<= 5 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {11762#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {11762#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {11752#false} ~i~0 := 0;~cont_aux~0 := 0; {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {11752#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {11752#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {11752#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {11752#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; {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {11752#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {11752#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {11752#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; {11752#false} is VALID [2022-04-28 09:05:13,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {11752#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {11752#false} assume !(~j~0 % 4294967296 < 2); {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {11752#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {11752#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {11752#false} assume !(0 != #t~mem11);havoc #t~mem11; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L272 TraceCheckUtils]: 46: Hoare triple {11752#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {11752#false} ~cond := #in~cond; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {11752#false} assume 0 == ~cond; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2022-04-28 09:05:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:05:13,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:13,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097187663] [2022-04-28 09:05:13,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097187663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:13,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51314704] [2022-04-28 09:05:13,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:05:13,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:13,414 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-28 09:05:13,415 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-28 09:05:13,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:05:13,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:13,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:05:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:13,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:13,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:05:13,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:13,891 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-28 09:05:13,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11751#true} is VALID [2022-04-28 09:05:13,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {11751#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); {11751#true} is VALID [2022-04-28 09:05:13,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-28 09:05:13,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-28 09:05:13,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {11751#true} call #t~ret17 := main(); {11751#true} is VALID [2022-04-28 09:05:13,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {11751#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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {11782#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {11782#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {11782#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {11782#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {11782#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {11782#(= |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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {11782#(= |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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {11782#(= |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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {11782#(= |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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {11782#(= |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; {11782#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:05:13,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {11782#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {11855#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:13,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {11855#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {11859#(and (= |main_~#input_string~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:05:13,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {11859#(and (= |main_~#input_string~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} ~cont~0 := 0;~i~0 := 0; {11863#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:05:13,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {11863#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {11867#(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-28 09:05:13,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {11867#(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; {11871#(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-28 09:05:13,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {11871#(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 + ~i~0 % 4294967296, 1); {11875#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {11875#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11752#false} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {11752#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {11752#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; {11752#false} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {11752#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11752#false} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {11752#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {11752#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; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {11752#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {11752#false} assume !(~j~0 % 4294967296 < 2); {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {11752#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {11752#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {11752#false} assume !(0 != #t~mem11);havoc #t~mem11; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L272 TraceCheckUtils]: 46: Hoare triple {11752#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {11752#false} ~cond := #in~cond; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {11752#false} assume 0 == ~cond; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2022-04-28 09:05:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 09:05:13,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:05:13,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51314704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:13,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:05:13,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-04-28 09:05:13,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:13,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411014154] [2022-04-28 09:05:13,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411014154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:13,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:13,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:05:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700493623] [2022-04-28 09:05:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:13,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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 50 [2022-04-28 09:05:13,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:13,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-28 09:05:13,971 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-28 09:05:13,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:05:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:05:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:05:13,971 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-28 09:05:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:14,605 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2022-04-28 09:05:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:05:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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 50 [2022-04-28 09:05:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-28 09:05:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 09:05:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-28 09:05:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-28 09:05:14,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-28 09:05:14,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:14,660 INFO L225 Difference]: With dead ends: 125 [2022-04-28 09:05:14,660 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 09:05:14,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:05:14,661 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:14,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-04-28 09:05:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 09:05:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-04-28 09:05:15,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:15,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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-28 09:05:15,026 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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-28 09:05:15,026 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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-28 09:05:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:15,028 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-28 09:05:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-28 09:05:15,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:15,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:15,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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 97 states. [2022-04-28 09:05:15,028 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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 97 states. [2022-04-28 09:05:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:15,029 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-28 09:05:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-28 09:05:15,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:15,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:15,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:15,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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-28 09:05:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-04-28 09:05:15,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 50 [2022-04-28 09:05:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:15,031 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-04-28 09:05:15,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-28 09:05:15,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 88 transitions. [2022-04-28 09:05:15,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-28 09:05:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:15,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:15,219 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-28 09:05:15,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:15,420 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-28 09:05:15,420 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 28908263, now seen corresponding path program 1 times [2022-04-28 09:05:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113093671] [2022-04-28 09:05:15,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:15,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 28908263, now seen corresponding path program 2 times [2022-04-28 09:05:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:15,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055724350] [2022-04-28 09:05:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:15,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:15,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {12524#(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); {12511#true} is VALID [2022-04-28 09:05:15,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-28 09:05:15,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-28 09:05:15,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:15,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {12524#(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); {12511#true} is VALID [2022-04-28 09:05:15,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-28 09:05:15,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {12511#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; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-28 09:05:15,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {12511#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {12511#true} is VALID [2022-04-28 09:05:15,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {12511#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {12511#true} is VALID [2022-04-28 09:05:15,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:15,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {12511#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {12511#true} is VALID [2022-04-28 09:05:15,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:15,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-28 09:05:15,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#true} ~cont~0 := 0;~i~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:15,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {12516#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:15,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {12516#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:15,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {12516#(= 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; {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:15,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:15,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {12517#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:15,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {12517#(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; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {12519#(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 + ~i~0 % 4294967296, 1); {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {12519#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:15,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {12519#(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; {12520#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-28 09:05:15,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {12520#(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; {12520#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-28 09:05:15,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {12520#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12520#(and (<= main_~cont~0 (+ main_~cont_aux~0 1)) (<= (+ main_~cont_aux~0 1) main_~cont~0))} is VALID [2022-04-28 09:05:15,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {12520#(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; {12521#(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-28 09:05:15,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {12521#(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; {12521#(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-28 09:05:15,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {12521#(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); {12521#(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-28 09:05:15,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {12521#(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; {12521#(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-28 09:05:15,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {12521#(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 + ~i~0 % 4294967296, 1); {12521#(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-28 09:05:15,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {12521#(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; {12521#(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-28 09:05:15,639 INFO L272 TraceCheckUtils]: 47: Hoare triple {12521#(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)); {12522#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:05:15,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {12522#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12523#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:05:15,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {12523#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12512#false} is VALID [2022-04-28 09:05:15,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-28 09:05:15,640 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-28 09:05:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055724350] [2022-04-28 09:05:15,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055724350] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:15,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997031980] [2022-04-28 09:05:15,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:15,641 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:15,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 09:05:15,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:15,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:15,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:05:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:15,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:16,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2022-04-28 09:05:16,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#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); {12511#true} is VALID [2022-04-28 09:05:16,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-28 09:05:16,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-28 09:05:16,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-28 09:05:16,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {12511#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; {12543#(= main_~i~0 0)} is VALID [2022-04-28 09:05:16,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {12543#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12543#(= main_~i~0 0)} is VALID [2022-04-28 09:05:16,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {12543#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12550#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {12550#(= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12550#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {12550#(= (+ (- 1) main_~i~0) 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {12511#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {12511#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {12511#true} is VALID [2022-04-28 09:05:16,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {12511#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {12511#true} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#true} ~cont~0 := 0;~i~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {12516#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:16,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {12516#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12516#(= main_~cont~0 0)} is VALID [2022-04-28 09:05:16,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {12516#(= 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; {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:16,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:16,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {12517#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12517#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2022-04-28 09:05:16,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {12517#(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; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {12518#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {12519#(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 + ~i~0 % 4294967296, 1); {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {12519#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12519#(and (= main_~cont_aux~0 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {12519#(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; {12644#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {12644#(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; {12644#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {12644#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12644#(and (= (+ (- 1) main_~cont_aux~0) 0) (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {12644#(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; {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} assume !(0 != #t~mem11);havoc #t~mem11; {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2022-04-28 09:05:16,175 INFO L272 TraceCheckUtils]: 47: Hoare triple {12654#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:05:16,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:05:16,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {12677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12512#false} is VALID [2022-04-28 09:05:16,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-28 09:05:16,176 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-28 09:05:16,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:16,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-28 09:05:16,399 INFO L290 TraceCheckUtils]: 49: Hoare triple {12677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12512#false} is VALID [2022-04-28 09:05:16,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:05:16,400 INFO L272 TraceCheckUtils]: 47: Hoare triple {12693#(= (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)); {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:05:16,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(0 != #t~mem11);havoc #t~mem11; {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {12712#(= (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; {12693#(= (mod main_~cont_aux~0 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {12712#(= (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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12712#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {12712#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12712#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {12722#(= (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; {12712#(= (mod (+ main_~cont_aux~0 1) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {12722#(= (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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12722#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {12722#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {12722#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {12722#(= (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 + ~i~0 % 4294967296, 1); {12722#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {12735#(= 2 (mod main_~cont~0 4294967296))} ~i~0 := 0;~cont_aux~0 := 0; {12722#(= (mod (+ 2 main_~cont_aux~0) 4294967296) (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {12735#(= 2 (mod main_~cont~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {12735#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {12735#(= 2 (mod main_~cont~0 4294967296))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12735#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {12735#(= 2 (mod main_~cont~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {12735#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {12735#(= 2 (mod main_~cont~0 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12735#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {12751#(= (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; {12735#(= 2 (mod main_~cont~0 4294967296))} is VALID [2022-04-28 09:05:16,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {12751#(= (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12751#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-28 09:05:16,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {12751#(= (mod (+ main_~cont~0 1) 4294967296) 2)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12751#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-28 09:05:16,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {12761#(= 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; {12751#(= (mod (+ main_~cont~0 1) 4294967296) 2)} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {12761#(= 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {12761#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {12761#(= 2 (mod (+ main_~cont~0 2) 4294967296))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {12761#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#true} ~cont~0 := 0;~i~0 := 0; {12761#(= 2 (mod (+ main_~cont~0 2) 4294967296))} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:16,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {12511#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {12511#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {12511#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {12511#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {12511#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12511#true} is VALID [2022-04-28 09:05:16,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {12511#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {12511#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; {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#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); {12511#true} is VALID [2022-04-28 09:05:16,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2022-04-28 09:05:16,410 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-28 09:05:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997031980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:16,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 23 [2022-04-28 09:05:16,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:16,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113093671] [2022-04-28 09:05:16,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113093671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:16,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:16,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:05:16,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613169724] [2022-04-28 09:05:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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 51 [2022-04-28 09:05:16,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:16,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:16,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:16,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:05:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:05:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:05:16,441 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:19,087 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2022-04-28 09:05:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:05:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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 51 [2022-04-28 09:05:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-04-28 09:05:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-04-28 09:05:19,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 155 transitions. [2022-04-28 09:05:19,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:19,239 INFO L225 Difference]: With dead ends: 188 [2022-04-28 09:05:19,239 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 09:05:19,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:05:19,240 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 195 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:19,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 144 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:05:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 09:05:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2022-04-28 09:05:19,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:19,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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-28 09:05:19,972 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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-28 09:05:19,973 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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-28 09:05:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:19,975 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2022-04-28 09:05:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2022-04-28 09:05:19,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:19,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:19,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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 182 states. [2022-04-28 09:05:19,976 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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 182 states. [2022-04-28 09:05:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:19,979 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2022-04-28 09:05:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2022-04-28 09:05:19,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:19,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:19,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:19,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 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-28 09:05:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-04-28 09:05:19,982 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 51 [2022-04-28 09:05:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:19,982 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-04-28 09:05:19,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:19,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 148 transitions. [2022-04-28 09:05:20,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-04-28 09:05:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:20,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:20,366 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-28 09:05:20,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:20,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:20,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -364118747, now seen corresponding path program 1 times [2022-04-28 09:05:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:20,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [895198112] [2022-04-28 09:05:20,571 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:20,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash -364118747, now seen corresponding path program 2 times [2022-04-28 09:05:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:20,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980077091] [2022-04-28 09:05:20,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:20,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {13847#(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); {13836#true} is VALID [2022-04-28 09:05:20,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-28 09:05:20,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-28 09:05:20,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:20,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {13847#(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); {13836#true} is VALID [2022-04-28 09:05:20,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-28 09:05:20,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-28 09:05:20,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-28 09:05:20,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {13836#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; {13841#(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-28 09:05:20,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {13841#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13841#(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-28 09:05:20,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {13841#(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; {13841#(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-28 09:05:20,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {13841#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13841#(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-28 09:05:20,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {13841#(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; {13841#(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-28 09:05:20,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {13841#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13841#(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-28 09:05:20,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {13841#(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; {13841#(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-28 09:05:20,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {13841#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13841#(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-28 09:05:20,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {13841#(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; {13841#(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-28 09:05:20,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {13841#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13841#(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-28 09:05:20,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {13841#(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; {13841#(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-28 09:05:20,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {13841#(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); {13841#(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-28 09:05:20,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {13841#(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); {13841#(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-28 09:05:20,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {13841#(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; {13841#(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-28 09:05:20,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {13841#(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 + ~n_caracter~0 % 4294967296, 1); {13841#(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-28 09:05:20,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {13841#(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; {13841#(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-28 09:05:20,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {13841#(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 + ~n_caracter~0 % 4294967296, 1); {13841#(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-28 09:05:20,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {13841#(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; {13841#(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-28 09:05:20,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {13841#(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; {13841#(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-28 09:05:20,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {13841#(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; {13842#(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-28 09:05:20,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {13842#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13843#(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)) |main_#t~mem9|)) (= main_~j~0 0) (= |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|))))} is VALID [2022-04-28 09:05:20,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {13843#(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)) |main_#t~mem9|)) (= main_~j~0 0) (= |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|))))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {13844#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= main_~j~0 0) (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-28 09:05:20,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {13844#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (= main_~j~0 0) (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; {13845#(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) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (or (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|)))) (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) (+ |main_~#vogal_array~0.offset| 1)))))} is VALID [2022-04-28 09:05:20,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {13845#(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) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (or (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|)))) (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) (+ |main_~#vogal_array~0.offset| 1)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13846#(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|)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1))} is VALID [2022-04-28 09:05:20,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {13846#(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|)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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; {13837#false} is VALID [2022-04-28 09:05:20,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {13837#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13837#false} is VALID [2022-04-28 09:05:20,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {13837#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {13837#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {13837#false} ~i~0 := 0;~cont_aux~0 := 0; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {13837#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {13837#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {13837#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {13837#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; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {13837#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {13837#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {13837#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {13837#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13837#false} is VALID [2022-04-28 09:05:20,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 44: Hoare triple {13837#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {13837#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L272 TraceCheckUtils]: 47: Hoare triple {13837#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-28 09:05:20,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-28 09:05:20,934 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-28 09:05:20,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:20,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980077091] [2022-04-28 09:05:20,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980077091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181009484] [2022-04-28 09:05:20,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:20,936 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:20,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 09:05:21,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:21,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:21,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 09:05:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:21,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:21,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:21,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 09:05:21,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2022-04-28 09:05:21,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {13836#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); {13836#true} is VALID [2022-04-28 09:05:21,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-28 09:05:21,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-28 09:05:21,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-28 09:05:21,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {13836#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; {13866#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:21,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {13866#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13866#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:21,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {13866#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {13873#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {13873#(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; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {13873#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {13873#(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; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {13873#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {13873#(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; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {13873#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {13873#(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; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {13873#(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); {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {13873#(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 + ~n_caracter~0 % 4294967296, 1); {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {13873#(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; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {13873#(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 + ~n_caracter~0 % 4294967296, 1); {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:21,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {13873#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {13866#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:21,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {13866#(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; {13925#(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-28 09:05:21,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {13925#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13929#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) |main_#t~mem8|))} is VALID [2022-04-28 09:05:21,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {13929#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |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; {13925#(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-28 09:05:21,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {13925#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13936#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:21,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {13936#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (= |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13940#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:05:21,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {13940#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {13944#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {13960#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {13960#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {13960#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {13960#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} 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; {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {13967#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13977#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:21,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {13977#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13981#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:21,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {13981#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {13837#false} is VALID [2022-04-28 09:05:21,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {13837#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13837#false} is VALID [2022-04-28 09:05:21,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-28 09:05:21,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {13837#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {13837#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L272 TraceCheckUtils]: 47: Hoare triple {13837#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-28 09:05:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 09:05:21,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:22,346 INFO L356 Elim1Store]: treesize reduction 31, result has 68.0 percent of original size [2022-04-28 09:05:22,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 73 [2022-04-28 09:05:22,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-28 09:05:22,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-28 09:05:22,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-28 09:05:22,593 INFO L272 TraceCheckUtils]: 47: Hoare triple {13837#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {13837#false} is VALID [2022-04-28 09:05:22,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-28 09:05:22,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {13837#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {13837#false} is VALID [2022-04-28 09:05:22,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {13837#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {13837#false} is VALID [2022-04-28 09:05:22,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-28 09:05:22,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {13837#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {13837#false} is VALID [2022-04-28 09:05:22,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {13981#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {13837#false} is VALID [2022-04-28 09:05:22,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {14042#(= (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|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {13981#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:22,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {14042#(= (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|)))} is VALID [2022-04-28 09:05:22,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} 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; {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:22,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:22,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {14056#(= (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| 1)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {14046#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:22,597 INFO L290 TraceCheckUtils]: 35: Hoare triple {14056#(= (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| 1)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {14056#(= (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| 1)))} is VALID [2022-04-28 09:05:22,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {14056#(= (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| 1)))} is VALID [2022-04-28 09:05:22,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:22,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:22,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} assume !(~j~0 % 4294967296 < 2); {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:22,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:22,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {14079#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~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; {14063#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:22,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {14083#(forall ((|main_~#vogal_array~0.base| Int)) (or (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (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|))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {14079#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:22,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {14087#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {14083#(forall ((|main_~#vogal_array~0.base| Int)) (or (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (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|))))))} is VALID [2022-04-28 09:05:22,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {14087#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~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; {14087#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:22,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {14094#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {14087#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {14098#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {14094#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {13836#true} ~cont~0 := 0;~i~0 := 0; {14098#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {13836#true} assume !(0 != #t~mem4);havoc #t~mem4; {13836#true} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {13836#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {13836#true} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {13836#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {13836#true} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {13836#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {13836#true} is VALID [2022-04-28 09:05:22,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {13836#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {13836#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {13836#true} assume !(~i~0 % 4294967296 < 5); {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {13836#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {13836#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {13836#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {13836#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {13836#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {13836#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {13836#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {13836#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {13836#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {13836#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {13836#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; {13836#true} is VALID [2022-04-28 09:05:22,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-28 09:05:22,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-28 09:05:22,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-28 09:05:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {13836#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); {13836#true} is VALID [2022-04-28 09:05:22,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2022-04-28 09:05:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:22,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181009484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:22,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:22,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 29 [2022-04-28 09:05:22,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:22,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [895198112] [2022-04-28 09:05:22,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [895198112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:22,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:22,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:05:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488529820] [2022-04-28 09:05:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 51 [2022-04-28 09:05:22,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:22,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-28 09:05:22,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:22,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:05:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:22,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:05:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=1, NotChecked=0, Total=812 [2022-04-28 09:05:22,639 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-28 09:05:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:24,067 INFO L93 Difference]: Finished difference Result 197 states and 254 transitions. [2022-04-28 09:05:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:05:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 51 [2022-04-28 09:05:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-28 09:05:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 09:05:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-28 09:05:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 09:05:24,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-28 09:05:24,135 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-28 09:05:24,136 INFO L225 Difference]: With dead ends: 197 [2022-04-28 09:05:24,136 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 09:05:24,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=1036, Unknown=1, NotChecked=0, Total=1190 [2022-04-28 09:05:24,137 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:24,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 54 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:05:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 09:05:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2022-04-28 09:05:24,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:24,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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-28 09:05:24,976 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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-28 09:05:24,976 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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-28 09:05:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:24,977 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-28 09:05:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-28 09:05:24,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:24,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:24,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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 128 states. [2022-04-28 09:05:24,978 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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 128 states. [2022-04-28 09:05:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:24,980 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-28 09:05:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-28 09:05:24,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:24,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:24,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:24,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 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-28 09:05:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2022-04-28 09:05:24,982 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 51 [2022-04-28 09:05:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:24,982 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2022-04-28 09:05:24,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-28 09:05:24,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 157 transitions. [2022-04-28 09:05:25,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2022-04-28 09:05:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:25,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:25,400 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-28 09:05:25,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:25,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 09:05:25,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 247762981, now seen corresponding path program 1 times [2022-04-28 09:05:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:25,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311043121] [2022-04-28 09:05:25,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:25,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:25,604 INFO L85 PathProgramCache]: Analyzing trace with hash 247762981, now seen corresponding path program 2 times [2022-04-28 09:05:25,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:25,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306069566] [2022-04-28 09:05:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:25,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:25,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {15097#(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); {15085#true} is VALID [2022-04-28 09:05:25,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-28 09:05:25,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-28 09:05:25,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {15085#true} call ULTIMATE.init(); {15097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:25,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {15097#(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); {15085#true} is VALID [2022-04-28 09:05:25,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-28 09:05:25,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-28 09:05:25,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-28 09:05:25,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {15085#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; {15090#(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-28 09:05:25,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {15090#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15090#(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-28 09:05:25,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {15090#(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; {15090#(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-28 09:05:25,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {15090#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15090#(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-28 09:05:25,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {15090#(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; {15090#(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-28 09:05:25,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {15090#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15090#(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-28 09:05:25,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {15090#(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; {15090#(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-28 09:05:25,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {15090#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15090#(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-28 09:05:25,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {15090#(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; {15090#(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-28 09:05:25,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {15090#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 + ~n_caracter~0 % 4294967296, 1); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 + ~n_caracter~0 % 4294967296, 1); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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 !(~j~0 % 4294967296 < 2); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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|))))} ~i~0 := 0;~cont_aux~0 := 0; {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15091#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {15091#(and (= |main_~#vogal_array~0.offset| 0) (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~mem11);havoc #t~mem11;~j~0 := 0; {15092#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:05:25,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {15092#(and (= |main_~#vogal_array~0.offset| 0) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15093#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (not (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))))} is VALID [2022-04-28 09:05:25,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {15093#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (not (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))))} 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; {15094#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (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-28 09:05:25,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {15094#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15095#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (or (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|)))) (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) (+ |main_~#vogal_array~0.offset| 1)))))} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {15095#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (or (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|)))) (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) (+ |main_~#vogal_array~0.offset| 1)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15096#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {15096#(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; {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {15086#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {15086#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {15086#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-28 09:05:25,952 INFO L272 TraceCheckUtils]: 47: Hoare triple {15086#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {15086#false} is VALID [2022-04-28 09:05:25,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-28 09:05:25,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-28 09:05:25,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-28 09:05:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 09:05:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306069566] [2022-04-28 09:05:25,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306069566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:25,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581043089] [2022-04-28 09:05:25,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:25,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:25,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:25,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:25,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 09:05:26,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:26,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:26,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 09:05:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:26,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:26,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:26,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-04-28 09:05:26,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {15085#true} call ULTIMATE.init(); {15085#true} is VALID [2022-04-28 09:05:26,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {15085#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); {15085#true} is VALID [2022-04-28 09:05:26,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-28 09:05:26,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-28 09:05:26,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-28 09:05:26,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {15085#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; {15116#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:26,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {15116#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15116#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:26,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {15116#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {15123#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {15123#(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; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {15123#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {15123#(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; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {15123#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {15123#(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; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {15123#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {15123#(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; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {15123#(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); {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {15123#(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 + ~n_caracter~0 % 4294967296, 1); {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {15123#(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; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {15123#(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 + ~n_caracter~0 % 4294967296, 1); {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:26,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {15123#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {15116#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:26,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {15116#(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; {15175#(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-28 09:05:26,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {15175#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15179#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) |main_#t~mem8|))} is VALID [2022-04-28 09:05:26,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {15179#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |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; {15175#(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-28 09:05:26,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {15175#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15186#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:26,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {15186#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15190#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:05:26,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {15190#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} assume !(~j~0 % 4294967296 < 2); {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {15194#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (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|) |main_~#input_string~0.offset|))))} ~i~0 := 0;~cont_aux~0 := 0; {15210#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {15210#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15210#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {15210#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} 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; {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {15217#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15227#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:26,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {15227#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (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|) |main_~#input_string~0.offset|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15096#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:05:26,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {15096#(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; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {15086#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {15086#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {15086#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L272 TraceCheckUtils]: 47: Hoare triple {15086#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-28 09:05:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 09:05:26,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:29,453 INFO L356 Elim1Store]: treesize reduction 23, result has 76.3 percent of original size [2022-04-28 09:05:29,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 81 [2022-04-28 09:05:29,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L272 TraceCheckUtils]: 47: Hoare triple {15086#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {15086#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {15086#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-28 09:05:29,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {15086#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15086#false} is VALID [2022-04-28 09:05:29,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {15096#(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; {15086#false} is VALID [2022-04-28 09:05:29,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {15291#(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|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15096#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:05:29,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {15291#(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|))))} is VALID [2022-04-28 09:05:29,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} 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; {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:05:29,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:05:29,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {15305#(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| 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {15295#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:05:29,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {15305#(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| 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {15305#(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| 1))))} is VALID [2022-04-28 09:05:29,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {15312#(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|) |main_~#input_string~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {15305#(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| 1))))} is VALID [2022-04-28 09:05:29,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {15312#(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|) |main_~#input_string~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {15312#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:29,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {15312#(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|) |main_~#input_string~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {15312#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:29,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {15312#(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|) |main_~#input_string~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {15312#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:29,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {15312#(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|) |main_~#input_string~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15312#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:29,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {15328#(or (= |main_#t~mem9| |main_#t~mem8|) (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|) |main_~#input_string~0.offset|))))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {15312#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:29,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {15332#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15328#(or (= |main_#t~mem9| |main_#t~mem8|) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:05:29,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {15336#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {15332#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:05:29,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {15336#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~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; {15336#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:05:29,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {15343#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {15336#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:05:29,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {15347#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {15343#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:29,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {15085#true} ~cont~0 := 0;~i~0 := 0; {15347#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {15085#true} assume !(0 != #t~mem4);havoc #t~mem4; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {15085#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {15085#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {15085#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {15085#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {15085#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {15085#true} assume !(~i~0 % 4294967296 < 5); {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {15085#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {15085#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {15085#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {15085#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {15085#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15085#true} is VALID [2022-04-28 09:05:29,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {15085#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {15085#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {15085#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {15085#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {15085#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {15085#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; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {15085#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); {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {15085#true} call ULTIMATE.init(); {15085#true} is VALID [2022-04-28 09:05:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581043089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:29,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:29,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 29 [2022-04-28 09:05:29,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311043121] [2022-04-28 09:05:29,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311043121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:29,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:29,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:05:29,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176582731] [2022-04-28 09:05:29,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:29,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 51 [2022-04-28 09:05:29,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:29,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:29,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:29,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:05:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:05:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=691, Unknown=5, NotChecked=0, Total=812 [2022-04-28 09:05:29,719 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:31,160 INFO L93 Difference]: Finished difference Result 162 states and 203 transitions. [2022-04-28 09:05:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:05:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 51 [2022-04-28 09:05:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 09:05:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-28 09:05:31,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-04-28 09:05:31,213 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-28 09:05:31,214 INFO L225 Difference]: With dead ends: 162 [2022-04-28 09:05:31,214 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 09:05:31,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=164, Invalid=1021, Unknown=5, NotChecked=0, Total=1190 [2022-04-28 09:05:31,215 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:31,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 58 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:05:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 09:05:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2022-04-28 09:05:32,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:32,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-28 09:05:32,080 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-28 09:05:32,095 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-28 09:05:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:32,097 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-28 09:05:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-04-28 09:05:32,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:32,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:32,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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 137 states. [2022-04-28 09:05:32,097 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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 137 states. [2022-04-28 09:05:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:32,099 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-28 09:05:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-04-28 09:05:32,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:32,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:32,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:32,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-28 09:05:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-28 09:05:32,104 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 51 [2022-04-28 09:05:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:32,104 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-28 09:05:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:05:32,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2022-04-28 09:05:32,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-28 09:05:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:32,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:32,555 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-28 09:05:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 09:05:32,755 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash -732070043, now seen corresponding path program 1 times [2022-04-28 09:05:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2092077070] [2022-04-28 09:05:32,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:32,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash -732070043, now seen corresponding path program 2 times [2022-04-28 09:05:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011279392] [2022-04-28 09:05:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:33,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {16313#(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); {16300#true} is VALID [2022-04-28 09:05:33,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-28 09:05:33,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-28 09:05:33,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:33,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {16313#(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); {16300#true} is VALID [2022-04-28 09:05:33,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-28 09:05:33,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-28 09:05:33,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-28 09:05:33,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {16305#(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); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {16305#(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 + ~n_caracter~0 % 4294967296, 1); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {16305#(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 + ~n_caracter~0 % 4294967296, 1); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {16306#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {16306#(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; {16307#(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-28 09:05:33,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {16307#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16308#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {16308#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} assume !(~j~0 % 4294967296 < 2); {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} ~i~0 := 0;~cont_aux~0 := 0; {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16312#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {16312#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:33,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:33,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {16301#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {16301#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {16301#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {16301#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L272 TraceCheckUtils]: 47: Hoare triple {16301#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-28 09:05:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 09:05:33,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:33,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011279392] [2022-04-28 09:05:33,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011279392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:33,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192946717] [2022-04-28 09:05:33,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:33,249 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:33,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 09:05:33,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:33,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:33,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:05:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:33,610 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-28 09:05:33,611 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-28 09:05:33,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-28 09:05:33,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-28 09:05:33,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-28 09:05:33,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-28 09:05:33,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-28 09:05:33,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {16305#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {16305#(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); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {16305#(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 + ~n_caracter~0 % 4294967296, 1); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {16305#(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; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {16305#(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 + ~n_caracter~0 % 4294967296, 1); {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:33,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {16305#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {16306#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {16306#(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; {16307#(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-28 09:05:33,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {16307#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16392#(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-28 09:05:33,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {16392#(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; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} assume !(~j~0 % 4294967296 < 2); {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} is VALID [2022-04-28 09:05:33,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {16311#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0)))} ~i~0 := 0;~cont_aux~0 := 0; {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} is VALID [2022-04-28 09:05:33,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {16310#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (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 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:33,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {16309#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16429#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {16429#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {16301#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {16301#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {16301#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {16301#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L272 TraceCheckUtils]: 47: Hoare triple {16301#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-28 09:05:33,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-28 09:05:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:05:33,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:33,837 INFO L356 Elim1Store]: treesize reduction 27, result has 68.2 percent of original size [2022-04-28 09:05:33,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 65 [2022-04-28 09:05:34,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L272 TraceCheckUtils]: 47: Hoare triple {16301#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {16301#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {16301#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {16301#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {16301#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16301#false} is VALID [2022-04-28 09:05:34,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {16301#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {16301#false} is VALID [2022-04-28 09:05:34,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {16429#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {16301#false} is VALID [2022-04-28 09:05:34,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {16508#(= (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|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16429#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:34,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {16512#(= (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|))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {16508#(= (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|)))} is VALID [2022-04-28 09:05:34,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {16512#(= (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|))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {16512#(= (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|))} is VALID [2022-04-28 09:05:34,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {16519#(= (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; {16512#(= (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|))} is VALID [2022-04-28 09:05:34,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {16519#(= (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); {16519#(= (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-28 09:05:34,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {16519#(= (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; {16519#(= (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-28 09:05:34,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {16519#(= (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); {16519#(= (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-28 09:05:34,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {16519#(= (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; {16519#(= (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-28 09:05:34,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {16519#(= (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; {16519#(= (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-28 09:05:34,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {16519#(= (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);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16519#(= (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-28 09:05:34,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {16519#(= (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; {16519#(= (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-28 09:05:34,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {16544#(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; {16519#(= (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-28 09:05:34,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {16548#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {16544#(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-28 09:05:34,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {16552#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {16548#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#true} ~cont~0 := 0;~i~0 := 0; {16552#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {16300#true} assume !(0 != #t~mem4);havoc #t~mem4; {16300#true} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {16300#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {16300#true} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {16300#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {16300#true} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {16300#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {16300#true} is VALID [2022-04-28 09:05:34,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {16300#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {16300#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {16300#true} assume !(~i~0 % 4294967296 < 5); {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {16300#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {16300#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {16300#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {16300#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {16300#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {16300#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {16300#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {16300#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {16300#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#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; {16300#true} is VALID [2022-04-28 09:05:34,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-28 09:05:34,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-28 09:05:34,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-28 09:05:34,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-28 09:05:34,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-28 09:05:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:05:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192946717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:34,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:34,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 19 [2022-04-28 09:05:34,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:34,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2092077070] [2022-04-28 09:05:34,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2092077070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:34,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:34,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:05:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596151424] [2022-04-28 09:05:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 51 [2022-04-28 09:05:34,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:34,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:34,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:05:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:05:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:05:34,066 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:37,022 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2022-04-28 09:05:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:05:37,022 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 51 [2022-04-28 09:05:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-28 09:05:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-28 09:05:37,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-04-28 09:05:37,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:37,109 INFO L225 Difference]: With dead ends: 372 [2022-04-28 09:05:37,109 INFO L226 Difference]: Without dead ends: 318 [2022-04-28 09:05:37,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:05:37,110 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:37,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 35 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:05:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-28 09:05:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 187. [2022-04-28 09:05:38,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:38,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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-28 09:05:38,383 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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-28 09:05:38,383 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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-28 09:05:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:38,388 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2022-04-28 09:05:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 406 transitions. [2022-04-28 09:05:38,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:38,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:38,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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 318 states. [2022-04-28 09:05:38,388 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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 318 states. [2022-04-28 09:05:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:38,392 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2022-04-28 09:05:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 406 transitions. [2022-04-28 09:05:38,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:38,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:38,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:38,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 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-28 09:05:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2022-04-28 09:05:38,395 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 51 [2022-04-28 09:05:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:38,395 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2022-04-28 09:05:38,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:38,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 232 transitions. [2022-04-28 09:05:39,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2022-04-28 09:05:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:39,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:39,191 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-28 09:05:39,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:39,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:39,399 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -810376151, now seen corresponding path program 3 times [2022-04-28 09:05:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:39,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113580041] [2022-04-28 09:05:39,404 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:39,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -810376151, now seen corresponding path program 4 times [2022-04-28 09:05:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826757232] [2022-04-28 09:05:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:40,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {18416#(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); {18397#true} is VALID [2022-04-28 09:05:40,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-28 09:05:40,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-28 09:05:40,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {18397#true} call ULTIMATE.init(); {18416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:40,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {18416#(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); {18397#true} is VALID [2022-04-28 09:05:40,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-28 09:05:40,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-28 09:05:40,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-28 09:05:40,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {18397#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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {18402#(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); {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:05:40,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:05:40,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} assume !(0 != #t~mem4);havoc #t~mem4; {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:05:40,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {18404#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)))} ~cont~0 := 0;~i~0 := 0; {18405#(and (or (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (and (<= main_~n_caracter~0 1) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {18405#(and (or (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (and (<= main_~n_caracter~0 1) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {18406#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18407#(and (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {18407#(and (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18408#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {18408#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |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; {18409#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {18409#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18410#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {18410#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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); {18410#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {18410#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18414#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (= (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|)))) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} is VALID [2022-04-28 09:05:40,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {18414#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (= (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|)))) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18415#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= main_~i~0 0))} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {18415#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {18398#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {18398#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {18398#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L272 TraceCheckUtils]: 47: Hoare triple {18398#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-28 09:05:40,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-28 09:05:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:05:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:40,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826757232] [2022-04-28 09:05:40,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826757232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:40,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447196153] [2022-04-28 09:05:40,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:05:40,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:40,119 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:40,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 09:05:40,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:05:40,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:40,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 09:05:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:40,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:40,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:05:40,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 09:05:40,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {18397#true} call ULTIMATE.init(); {18397#true} is VALID [2022-04-28 09:05:40,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#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); {18397#true} is VALID [2022-04-28 09:05:40,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-28 09:05:40,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-28 09:05:40,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-28 09:05:40,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {18397#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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {18402#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {18402#(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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {18402#(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); {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {18403#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {18402#(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 + ~n_caracter~0 % 4294967296, 1); {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {18402#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {18489#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:40,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {18489#(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; {18493#(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-28 09:05:40,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {18493#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18493#(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-28 09:05:40,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {18493#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {18493#(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-28 09:05:40,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {18493#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18503#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:40,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {18503#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18507#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:05:40,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {18507#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:40,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {18411#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {18412#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {18413#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18541#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:05:40,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {18541#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18545#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {18545#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {18398#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {18398#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {18398#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L272 TraceCheckUtils]: 47: Hoare triple {18398#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {18398#false} is VALID [2022-04-28 09:05:40,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-28 09:05:40,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-28 09:05:40,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-28 09:05:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:05:40,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:40,843 INFO L356 Elim1Store]: treesize reduction 29, result has 68.1 percent of original size [2022-04-28 09:05:40,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 69 [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L272 TraceCheckUtils]: 47: Hoare triple {18398#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {18398#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 44: Hoare triple {18398#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-28 09:05:41,078 INFO L290 TraceCheckUtils]: 42: Hoare triple {18398#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18398#false} is VALID [2022-04-28 09:05:41,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {18545#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18398#false} is VALID [2022-04-28 09:05:41,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {18606#(= (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|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18545#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:05:41,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {18606#(= (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|)))} is VALID [2022-04-28 09:05:41,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:41,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:41,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {18620#(= (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| 1)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {18610#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:05:41,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {18620#(= (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| 1)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {18620#(= (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| 1)))} is VALID [2022-04-28 09:05:41,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {18620#(= (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| 1)))} is VALID [2022-04-28 09:05:41,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:41,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:41,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} assume !(~j~0 % 4294967296 < 2); {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:41,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:41,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {18643#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~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; {18627#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))} is VALID [2022-04-28 09:05:41,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {18647#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18643#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:05:41,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {18647#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:41,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:41,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:41,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {18661#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {18651#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:41,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {18397#true} ~cont~0 := 0;~i~0 := 0; {18661#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:05:41,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {18397#true} assume !(0 != #t~mem4);havoc #t~mem4; {18397#true} is VALID [2022-04-28 09:05:41,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {18397#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {18397#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {18397#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {18397#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {18397#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {18397#true} assume !(~i~0 % 4294967296 < 5); {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {18397#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {18397#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {18397#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {18397#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {18397#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {18397#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {18397#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18397#true} is VALID [2022-04-28 09:05:41,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {18397#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {18397#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {18397#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {18397#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; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#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); {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {18397#true} call ULTIMATE.init(); {18397#true} is VALID [2022-04-28 09:05:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:05:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447196153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:41,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 31 [2022-04-28 09:05:41,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113580041] [2022-04-28 09:05:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113580041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:41,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 09:05:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278941959] [2022-04-28 09:05:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 51 [2022-04-28 09:05:41,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:41,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-28 09:05:41,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 09:05:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 09:05:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:05:41,130 INFO L87 Difference]: Start difference. First operand 187 states and 232 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-28 09:05:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:48,749 INFO L93 Difference]: Finished difference Result 856 states and 1103 transitions. [2022-04-28 09:05:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 09:05:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 51 [2022-04-28 09:05:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-28 09:05:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 202 transitions. [2022-04-28 09:05:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-28 09:05:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 202 transitions. [2022-04-28 09:05:48,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 202 transitions. [2022-04-28 09:05:48,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:48,965 INFO L225 Difference]: With dead ends: 856 [2022-04-28 09:05:48,965 INFO L226 Difference]: Without dead ends: 670 [2022-04-28 09:05:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=642, Invalid=2550, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:05:48,966 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 244 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 72 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:05:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-04-28 09:05:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 357. [2022-04-28 09:05:51,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:05:51,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 670 states. Second operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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-28 09:05:51,604 INFO L74 IsIncluded]: Start isIncluded. First operand 670 states. Second operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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-28 09:05:51,604 INFO L87 Difference]: Start difference. First operand 670 states. Second operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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-28 09:05:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:51,617 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2022-04-28 09:05:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 852 transitions. [2022-04-28 09:05:51,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:51,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:51,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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 670 states. [2022-04-28 09:05:51,619 INFO L87 Difference]: Start difference. First operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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 670 states. [2022-04-28 09:05:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:51,632 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2022-04-28 09:05:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 852 transitions. [2022-04-28 09:05:51,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:05:51,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:05:51,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:05:51,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:05:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.2897727272727273) internal successors, (454), 352 states have internal predecessors, (454), 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-28 09:05:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 458 transitions. [2022-04-28 09:05:51,639 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 458 transitions. Word has length 51 [2022-04-28 09:05:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:05:51,639 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 458 transitions. [2022-04-28 09:05:51,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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-28 09:05:51,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 458 transitions. [2022-04-28 09:05:53,146 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-28 09:05:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 458 transitions. [2022-04-28 09:05:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:05:53,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:05:53,147 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-28 09:05:53,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 09:05:53,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:53,347 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:05:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:05:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash -4715419, now seen corresponding path program 1 times [2022-04-28 09:05:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:53,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569145503] [2022-04-28 09:05:53,351 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:05:53,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:05:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -4715419, now seen corresponding path program 2 times [2022-04-28 09:05:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:05:53,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500932603] [2022-04-28 09:05:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:05:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:05:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:05:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:53,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {22567#(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); {22554#true} is VALID [2022-04-28 09:05:53,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-28 09:05:53,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-28 09:05:53,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {22554#true} call ULTIMATE.init(); {22567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:05:53,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {22567#(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); {22554#true} is VALID [2022-04-28 09:05:53,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-28 09:05:53,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-28 09:05:53,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-28 09:05:53,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {22554#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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {22559#(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); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {22559#(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 + ~n_caracter~0 % 4294967296, 1); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {22559#(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 + ~n_caracter~0 % 4294967296, 1); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {22560#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {22560#(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; {22561#(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-28 09:05:53,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {22561#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22562#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {22562#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:53,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~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 + ~i~0 % 4294967296, 1); {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22566#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_#t~mem14| |main_#t~mem13|)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {22566#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_#t~mem14| |main_#t~mem13|)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {22555#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {22555#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {22555#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {22555#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-28 09:05:53,839 INFO L272 TraceCheckUtils]: 47: Hoare triple {22555#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {22555#false} is VALID [2022-04-28 09:05:53,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-28 09:05:53,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-28 09:05:53,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-28 09:05:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 09:05:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:05:53,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500932603] [2022-04-28 09:05:53,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500932603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:05:53,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014877871] [2022-04-28 09:05:53,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:05:53,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:05:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:05:53,843 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:05:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 09:05:53,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:05:53,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:05:53,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 09:05:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:05:53,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:05:54,234 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-28 09:05:54,235 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-28 09:05:54,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {22554#true} call ULTIMATE.init(); {22554#true} is VALID [2022-04-28 09:05:54,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {22554#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); {22554#true} is VALID [2022-04-28 09:05:54,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-28 09:05:54,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-28 09:05:54,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-28 09:05:54,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {22554#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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {22559#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {22559#(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); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {22559#(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 + ~n_caracter~0 % 4294967296, 1); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {22559#(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; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {22559#(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 + ~n_caracter~0 % 4294967296, 1); {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {22559#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {22560#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:54,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {22560#(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; {22561#(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-28 09:05:54,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {22561#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22646#(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-28 09:05:54,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {22646#(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; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:05:54,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {22565#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:54,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~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 + ~i~0 % 4294967296, 1); {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:05:54,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {22564#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} is VALID [2022-04-28 09:05:54,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {22563#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22683#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:05:54,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {22683#(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; {22555#false} is VALID [2022-04-28 09:05:54,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:54,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {22555#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {22555#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {22555#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {22555#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L272 TraceCheckUtils]: 47: Hoare triple {22555#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-28 09:05:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:05:54,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:05:54,482 INFO L356 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2022-04-28 09:05:54,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 73 [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L272 TraceCheckUtils]: 47: Hoare triple {22555#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {22555#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {22555#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {22555#false} is VALID [2022-04-28 09:05:54,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {22555#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {22555#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {22555#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {22683#(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; {22555#false} is VALID [2022-04-28 09:05:54,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {22762#(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|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22683#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:05:54,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {22766#(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|)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {22762#(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|))))} is VALID [2022-04-28 09:05:54,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {22766#(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|)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {22766#(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|)))} is VALID [2022-04-28 09:05:54,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {22773#(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; {22766#(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|)))} is VALID [2022-04-28 09:05:54,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {22773#(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); {22773#(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-28 09:05:54,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {22773#(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; {22773#(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-28 09:05:54,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {22773#(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); {22773#(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-28 09:05:54,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {22773#(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; {22773#(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-28 09:05:54,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {22773#(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 !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {22773#(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-28 09:05:54,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {22773#(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);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22773#(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-28 09:05:54,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {22773#(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; {22773#(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-28 09:05:54,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {22798#(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; {22773#(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-28 09:05:54,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {22802#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {22798#(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-28 09:05:54,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {22806#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {22802#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {22554#true} ~cont~0 := 0;~i~0 := 0; {22806#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {22554#true} assume !(0 != #t~mem4);havoc #t~mem4; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {22554#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {22554#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {22554#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {22554#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {22554#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {22554#true} assume !(~i~0 % 4294967296 < 5); {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {22554#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {22554#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {22554#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {22554#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22554#true} is VALID [2022-04-28 09:05:54,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {22554#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {22554#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {22554#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {22554#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {22554#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {22554#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {22554#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; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {22554#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); {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {22554#true} call ULTIMATE.init(); {22554#true} is VALID [2022-04-28 09:05:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:05:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014877871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:05:54,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:05:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 19 [2022-04-28 09:05:54,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:05:54,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569145503] [2022-04-28 09:05:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569145503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:05:54,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:05:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:05:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185964565] [2022-04-28 09:05:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:05:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 51 [2022-04-28 09:05:54,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:05:54,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:54,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:54,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:05:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:05:54,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:05:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:05:54,683 INFO L87 Difference]: Start difference. First operand 357 states and 458 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:05:59,412 INFO L93 Difference]: Finished difference Result 579 states and 760 transitions. [2022-04-28 09:05:59,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:05:59,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 51 [2022-04-28 09:05:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:05:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 09:05:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:05:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 09:05:59,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 09:05:59,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:05:59,515 INFO L225 Difference]: With dead ends: 579 [2022-04-28 09:05:59,515 INFO L226 Difference]: Without dead ends: 535 [2022-04-28 09:05:59,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:05:59,516 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:05:59,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 38 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:05:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-04-28 09:06:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 367. [2022-04-28 09:06:02,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:06:02,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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-28 09:06:02,310 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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-28 09:06:02,310 INFO L87 Difference]: Start difference. First operand 535 states. Second operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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-28 09:06:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:02,319 INFO L93 Difference]: Finished difference Result 535 states and 702 transitions. [2022-04-28 09:06:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 702 transitions. [2022-04-28 09:06:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:02,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:02,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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 535 states. [2022-04-28 09:06:02,320 INFO L87 Difference]: Start difference. First operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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 535 states. [2022-04-28 09:06:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:02,329 INFO L93 Difference]: Finished difference Result 535 states and 702 transitions. [2022-04-28 09:06:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 702 transitions. [2022-04-28 09:06:02,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:02,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:02,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:06:02,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:06:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.281767955801105) internal successors, (464), 362 states have internal predecessors, (464), 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-28 09:06:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 468 transitions. [2022-04-28 09:06:02,336 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 468 transitions. Word has length 51 [2022-04-28 09:06:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:06:02,336 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 468 transitions. [2022-04-28 09:06:02,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:06:02,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 468 transitions. [2022-04-28 09:06:03,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 468 transitions. [2022-04-28 09:06:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 09:06:03,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:06:03,877 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-28 09:06:03,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 09:06:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:04,078 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:06:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:06:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -198494423, now seen corresponding path program 3 times [2022-04-28 09:06:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:04,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809856914] [2022-04-28 09:06:04,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:06:04,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:06:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -198494423, now seen corresponding path program 4 times [2022-04-28 09:06:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:06:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886942066] [2022-04-28 09:06:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:06:04,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:06:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:04,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:06:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:04,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {25875#(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); {25859#true} is VALID [2022-04-28 09:06:04,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-28 09:06:04,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-28 09:06:04,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {25859#true} call ULTIMATE.init(); {25875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:06:04,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {25875#(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); {25859#true} is VALID [2022-04-28 09:06:04,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-28 09:06:04,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-28 09:06:04,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-28 09:06:04,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {25859#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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {25864#(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); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {25864#(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 + ~n_caracter~0 % 4294967296, 1); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {25864#(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 + ~n_caracter~0 % 4294967296, 1); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {25865#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:04,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {25865#(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; {25866#(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-28 09:06:04,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {25866#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25866#(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-28 09:06:04,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {25866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {25866#(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-28 09:06:04,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {25866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {25867#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} is VALID [2022-04-28 09:06:04,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {25867#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25868#(and (= |main_~#vogal_array~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:04,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {25868#(and (= |main_~#vogal_array~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {25869#(and (= |main_~#vogal_array~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} is VALID [2022-04-28 09:06:04,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {25869#(and (= |main_~#vogal_array~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0) (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|)))) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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); {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:04,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:04,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {25873#(and (= |main_~#vogal_array~0.offset| 0) (or (and (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 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (not (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:04,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {25873#(and (= |main_~#vogal_array~0.offset| 0) (or (and (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 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (not (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25874#(and (not (= |main_#t~mem14| |main_#t~mem13|)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:04,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {25874#(and (not (= |main_#t~mem14| |main_#t~mem13|)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {25860#false} is VALID [2022-04-28 09:06:04,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {25860#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {25860#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {25860#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L272 TraceCheckUtils]: 47: Hoare triple {25860#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-28 09:06:04,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-28 09:06:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:06:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:06:04,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886942066] [2022-04-28 09:06:04,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886942066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:06:04,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437108442] [2022-04-28 09:06:04,641 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:06:04,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:04,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:06:04,642 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:06:04,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 09:06:04,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:06:04,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:06:04,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 09:06:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:04,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:06:05,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:06:05,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-04-28 09:06:05,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {25859#true} call ULTIMATE.init(); {25859#true} is VALID [2022-04-28 09:06:05,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {25859#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); {25859#true} is VALID [2022-04-28 09:06:05,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-28 09:06:05,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-28 09:06:05,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-28 09:06:05,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {25859#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; {25865#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:05,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {25865#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25865#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:05,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {25865#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {25864#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {25864#(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); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {25864#(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 + ~n_caracter~0 % 4294967296, 1); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {25864#(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; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {25864#(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 + ~n_caracter~0 % 4294967296, 1); {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {25864#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {25865#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:05,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {25865#(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; {25866#(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-28 09:06:05,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {25866#(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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25866#(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-28 09:06:05,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {25866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {25866#(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-28 09:06:05,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {25866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {25960#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:05,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {25960#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25964#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:06:05,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {25964#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:05,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {25871#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 0) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {25870#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {25872#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {25998#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:06:05,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {25998#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {26002#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {26002#(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; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {25860#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {25860#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {25860#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L272 TraceCheckUtils]: 47: Hoare triple {25860#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-28 09:06:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 09:06:05,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:06:08,518 INFO L356 Elim1Store]: treesize reduction 23, result has 76.3 percent of original size [2022-04-28 09:06:08,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 81 [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L272 TraceCheckUtils]: 47: Hoare triple {25860#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {25860#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {25860#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-28 09:06:08,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {25860#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {25860#false} is VALID [2022-04-28 09:06:08,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {26002#(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; {25860#false} is VALID [2022-04-28 09:06:08,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {26063#(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|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {26002#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:06:08,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {26063#(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|))))} is VALID [2022-04-28 09:06:08,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:06:08,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:06:08,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {26077#(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| 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {26067#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:06:08,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {26077#(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| 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {26077#(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| 1))))} is VALID [2022-04-28 09:06:08,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {26084#(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|) |main_~#input_string~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {26077#(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| 1))))} is VALID [2022-04-28 09:06:08,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {26084#(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|) |main_~#input_string~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {26084#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:08,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {26084#(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|) |main_~#input_string~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {26084#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:08,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {26084#(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|) |main_~#input_string~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {26084#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:08,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {26084#(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|) |main_~#input_string~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {26084#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:08,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {26100#(or (= |main_#t~mem9| |main_#t~mem8|) (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|) |main_~#input_string~0.offset|))))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {26084#(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|) |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:08,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {26104#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {26100#(or (= |main_#t~mem9| |main_#t~mem8|) (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|) |main_~#input_string~0.offset|))))} is VALID [2022-04-28 09:06:08,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {26108#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {26104#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:06:08,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {26108#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {26108#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:06:08,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {26115#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {26108#(forall ((|main_~#vogal_array~0.base| Int)) (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|) (+ (mod (+ main_~j~0 1) 4294967296) |main_~#vogal_array~0.offset|))) (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|) |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:06:08,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {26119#(= (mod main_~i~0 4294967296) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {26115#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 0))} is VALID [2022-04-28 09:06:08,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {25859#true} ~cont~0 := 0;~i~0 := 0; {26119#(= (mod main_~i~0 4294967296) 0)} is VALID [2022-04-28 09:06:08,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {25859#true} assume !(0 != #t~mem4);havoc #t~mem4; {25859#true} is VALID [2022-04-28 09:06:08,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {25859#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {25859#true} is VALID [2022-04-28 09:06:08,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {25859#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {25859#true} is VALID [2022-04-28 09:06:08,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {25859#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {25859#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {25859#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {25859#true} assume !(~i~0 % 4294967296 < 5); {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {25859#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {25859#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {25859#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {25859#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {25859#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {25859#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {25859#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25859#true} is VALID [2022-04-28 09:06:08,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {25859#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {25859#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {25859#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {25859#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; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {25859#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); {25859#true} is VALID [2022-04-28 09:06:08,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {25859#true} call ULTIMATE.init(); {25859#true} is VALID [2022-04-28 09:06:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:06:08,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437108442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:06:08,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:06:08,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 27 [2022-04-28 09:06:08,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:06:08,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809856914] [2022-04-28 09:06:08,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809856914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:06:08,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:06:08,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:06:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161722931] [2022-04-28 09:06:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:06:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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 51 [2022-04-28 09:06:08,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:06:08,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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-28 09:06:08,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:08,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:06:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:08,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:06:08,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=565, Unknown=6, NotChecked=0, Total=702 [2022-04-28 09:06:08,761 INFO L87 Difference]: Start difference. First operand 367 states and 468 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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-28 09:06:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:14,073 INFO L93 Difference]: Finished difference Result 765 states and 982 transitions. [2022-04-28 09:06:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:06:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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 51 [2022-04-28 09:06:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:06:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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-28 09:06:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2022-04-28 09:06:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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-28 09:06:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2022-04-28 09:06:14,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 128 transitions. [2022-04-28 09:06:14,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:14,179 INFO L225 Difference]: With dead ends: 765 [2022-04-28 09:06:14,180 INFO L226 Difference]: Without dead ends: 496 [2022-04-28 09:06:14,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=321, Invalid=1233, Unknown=6, NotChecked=0, Total=1560 [2022-04-28 09:06:14,181 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 204 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:06:14,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 45 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:06:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-28 09:06:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 394. [2022-04-28 09:06:17,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:06:17,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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-28 09:06:17,246 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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-28 09:06:17,246 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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-28 09:06:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:17,258 INFO L93 Difference]: Finished difference Result 496 states and 629 transitions. [2022-04-28 09:06:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2022-04-28 09:06:17,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:17,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:17,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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 496 states. [2022-04-28 09:06:17,260 INFO L87 Difference]: Start difference. First operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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 496 states. [2022-04-28 09:06:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:17,267 INFO L93 Difference]: Finished difference Result 496 states and 629 transitions. [2022-04-28 09:06:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2022-04-28 09:06:17,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:17,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:17,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:06:17,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:06:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.275064267352185) internal successors, (496), 389 states have internal predecessors, (496), 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-28 09:06:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2022-04-28 09:06:17,275 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 51 [2022-04-28 09:06:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:06:17,275 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2022-04-28 09:06:17,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 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-28 09:06:17,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 394 states and 500 transitions. [2022-04-28 09:06:18,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2022-04-28 09:06:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 09:06:18,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:06:18,997 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 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, 1] [2022-04-28 09:06:19,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 09:06:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 09:06:19,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:06:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:06:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2072849753, now seen corresponding path program 1 times [2022-04-28 09:06:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:19,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [842747232] [2022-04-28 09:06:19,216 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:06:19,216 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:06:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2072849753, now seen corresponding path program 2 times [2022-04-28 09:06:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:06:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230725903] [2022-04-28 09:06:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:06:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:06:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:06:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:19,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {29538#(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); {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {29530#true} call ULTIMATE.init(); {29538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:06:19,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {29538#(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); {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-28 09:06:19,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {29530#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; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {29530#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {29530#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {29530#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {29530#true} is VALID [2022-04-28 09:06:19,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-28 09:06:19,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {29530#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {29530#true} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {29530#true} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {29530#true} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {29530#true} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {29530#true} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {29530#true} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {29530#true} assume !(~j~0 % 4294967296 < 2); {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {29530#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {29530#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {29530#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {29535#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {29535#(= main_~j~0 0)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {29535#(= main_~j~0 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} 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; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29537#(and (<= (div main_~j~0 4294967296) 0) (<= 2 main_~j~0))} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {29537#(and (<= (div main_~j~0 4294967296) 0) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {29531#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; {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {29531#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {29531#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {29531#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-28 09:06:19,274 INFO L272 TraceCheckUtils]: 50: Hoare triple {29531#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {29531#false} is VALID [2022-04-28 09:06:19,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-28 09:06:19,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-28 09:06:19,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-28 09:06:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-28 09:06:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:06:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230725903] [2022-04-28 09:06:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230725903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:06:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87848891] [2022-04-28 09:06:19,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:06:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:06:19,275 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:06:19,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 09:06:19,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:06:19,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:06:19,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:06:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:19,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:06:19,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {29530#true} call ULTIMATE.init(); {29530#true} is VALID [2022-04-28 09:06:19,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {29530#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); {29530#true} is VALID [2022-04-28 09:06:19,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-28 09:06:19,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-28 09:06:19,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-28 09:06:19,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {29530#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; {29557#(= main_~i~0 0)} is VALID [2022-04-28 09:06:19,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {29557#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29557#(= main_~i~0 0)} is VALID [2022-04-28 09:06:19,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {29557#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29564#(= main_~i~0 1)} is VALID [2022-04-28 09:06:19,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {29564#(= 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29564#(= main_~i~0 1)} is VALID [2022-04-28 09:06:19,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {29564#(= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {29530#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {29530#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {29530#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-28 09:06:19,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {29530#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {29535#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {29535#(= main_~j~0 0)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {29535#(= main_~j~0 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29634#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {29634#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < 2); {29530#true} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {29530#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {29530#true} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {29530#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {29530#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {29535#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {29535#(= main_~j~0 0)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {29535#(= main_~j~0 0)} is VALID [2022-04-28 09:06:19,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {29535#(= main_~j~0 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} 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; {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 09:06:19,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {29536#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29634#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {29634#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {29531#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; {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {29531#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {29531#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {29531#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L272 TraceCheckUtils]: 50: Hoare triple {29531#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {29531#false} is VALID [2022-04-28 09:06:19,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-28 09:06:19,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-28 09:06:19,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-28 09:06:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:06:19,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:06:19,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L272 TraceCheckUtils]: 50: Hoare triple {29531#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {29531#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {29531#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {29531#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {29531#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; {29531#false} is VALID [2022-04-28 09:06:19,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {29734#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29531#false} is VALID [2022-04-28 09:06:19,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29734#(not (< (mod main_~j~0 4294967296) 2))} is VALID [2022-04-28 09:06:19,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} 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; {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:06:19,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:06:19,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {29738#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:06:19,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} is VALID [2022-04-28 09:06:19,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} is VALID [2022-04-28 09:06:19,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {29530#true} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {29748#(not (< (mod (+ main_~j~0 2) 4294967296) 2))} is VALID [2022-04-28 09:06:19,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {29530#true} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {29530#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {29530#true} assume !(~j~0 % 4294967296 < 2); {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {29530#true} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {29530#true} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {29530#true} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {29530#true} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {29530#true} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {29530#true} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {29530#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {29530#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {29530#true} is VALID [2022-04-28 09:06:19,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {29530#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {29530#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {29530#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {29530#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {29530#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {29530#true} is VALID [2022-04-28 09:06:19,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {29530#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; {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {29530#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); {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {29530#true} call ULTIMATE.init(); {29530#true} is VALID [2022-04-28 09:06:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-28 09:06:19,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87848891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:06:19,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:06:19,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-04-28 09:06:19,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:06:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [842747232] [2022-04-28 09:06:19,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [842747232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:06:19,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:06:19,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:06:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54573627] [2022-04-28 09:06:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:06:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 54 [2022-04-28 09:06:19,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:06:19,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-28 09:06:19,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:19,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:06:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:06:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:06:19,840 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-28 09:06:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:23,154 INFO L93 Difference]: Finished difference Result 733 states and 928 transitions. [2022-04-28 09:06:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:06:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 54 [2022-04-28 09:06:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:06:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-28 09:06:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 09:06:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-28 09:06:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 09:06:23,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 09:06:23,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:23,206 INFO L225 Difference]: With dead ends: 733 [2022-04-28 09:06:23,206 INFO L226 Difference]: Without dead ends: 382 [2022-04-28 09:06:23,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:06:23,207 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:06:23,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:06:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-28 09:06:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 354. [2022-04-28 09:06:26,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:06:26,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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-28 09:06:26,092 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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-28 09:06:26,093 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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-28 09:06:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:26,097 INFO L93 Difference]: Finished difference Result 382 states and 446 transitions. [2022-04-28 09:06:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2022-04-28 09:06:26,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:26,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:26,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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 382 states. [2022-04-28 09:06:26,098 INFO L87 Difference]: Start difference. First operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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 382 states. [2022-04-28 09:06:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:26,103 INFO L93 Difference]: Finished difference Result 382 states and 446 transitions. [2022-04-28 09:06:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2022-04-28 09:06:26,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:26,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:26,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:06:26,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:06:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.186246418338109) internal successors, (414), 349 states have internal predecessors, (414), 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-28 09:06:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 418 transitions. [2022-04-28 09:06:26,109 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 418 transitions. Word has length 54 [2022-04-28 09:06:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:06:26,109 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 418 transitions. [2022-04-28 09:06:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-28 09:06:26,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 354 states and 418 transitions. [2022-04-28 09:06:27,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 418 transitions. [2022-04-28 09:06:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 09:06:27,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:06:27,577 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 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] [2022-04-28 09:06:27,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 09:06:27,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 09:06:27,788 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:06:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:06:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1813405083, now seen corresponding path program 3 times [2022-04-28 09:06:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:27,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150558923] [2022-04-28 09:06:27,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:06:27,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:06:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1813405083, now seen corresponding path program 4 times [2022-04-28 09:06:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:06:27,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673060486] [2022-04-28 09:06:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:06:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:06:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:06:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:27,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {32825#(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); {32815#true} is VALID [2022-04-28 09:06:27,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-28 09:06:27,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-28 09:06:27,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {32815#true} call ULTIMATE.init(); {32825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:06:27,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {32825#(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); {32815#true} is VALID [2022-04-28 09:06:27,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-28 09:06:27,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {32815#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; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {32815#true} assume !(~i~0 % 4294967296 < 5); {32815#true} is VALID [2022-04-28 09:06:27,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {32815#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {32815#true} is VALID [2022-04-28 09:06:27,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {32815#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {32820#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:06:27,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {32820#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {32820#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:06:27,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {32820#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {32821#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:06:27,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {32821#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {32822#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1))} is VALID [2022-04-28 09:06:27,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {32822#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1))} assume !(0 != #t~mem4);havoc #t~mem4; {32822#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1))} is VALID [2022-04-28 09:06:27,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {32822#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1))} ~cont~0 := 0;~i~0 := 0; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~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; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2022-04-28 09:06:27,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {32823#(and (<= 0 (div main_~n_caracter~0 4294967296)) (<= main_~n_caracter~0 1) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32824#(and (<= main_~n_caracter~0 main_~i~0) (<= main_~i~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 4294967295)))} is VALID [2022-04-28 09:06:27,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {32824#(and (<= main_~n_caracter~0 main_~i~0) (<= main_~i~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 4294967295)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32816#false} is VALID [2022-04-28 09:06:27,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {32816#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {32816#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {32816#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {32816#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {32816#false} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {32816#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {32816#false} assume !(~j~0 % 4294967296 < 2); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {32816#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {32816#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {32816#false} ~i~0 := 0;~cont_aux~0 := 0; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {32816#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {32816#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {32816#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {32816#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; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {32816#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {32816#false} is VALID [2022-04-28 09:06:27,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {32816#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {32816#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {32816#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {32816#false} assume !(~j~0 % 4294967296 < 2); {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {32816#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 54: Hoare triple {32816#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 55: Hoare triple {32816#false} assume !(0 != #t~mem11);havoc #t~mem11; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L272 TraceCheckUtils]: 56: Hoare triple {32816#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-28 09:06:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-28 09:06:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:06:27,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673060486] [2022-04-28 09:06:27,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673060486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:06:27,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747752886] [2022-04-28 09:06:27,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:06:27,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:27,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:06:27,915 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:06:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 09:06:27,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:06:27,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:06:27,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 09:06:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:28,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:06:28,907 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-28 09:06:28,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2022-04-28 09:06:28,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {32815#true} call ULTIMATE.init(); {32815#true} is VALID [2022-04-28 09:06:28,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {32815#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); {32815#true} is VALID [2022-04-28 09:06:28,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-28 09:06:28,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-28 09:06:28,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-28 09:06:28,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {32815#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; {32844#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {32844#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32844#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {32844#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {32851#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {32851#(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; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {32851#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {32851#(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; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {32851#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {32851#(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; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {32851#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {32851#(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; {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {32851#(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); {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {32851#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {32885#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:28,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {32885#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {32889#(and (= |main_~#vogal_array~0.offset| 0) (= |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-28 09:06:28,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {32889#(and (= |main_~#vogal_array~0.offset| 0) (= |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; {32893#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {32893#(and (= |main_~#vogal_array~0.offset| 0) (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 + ~n_caracter~0 % 4294967296, 1); {32893#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {32893#(and (= |main_~#vogal_array~0.offset| 0) (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; {32893#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {32893#(and (= |main_~#vogal_array~0.offset| 0) (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; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} assume !(~j~0 % 4294967296 < 2); {32903#(and (= |main_~#vogal_array~0.offset| 0) (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-28 09:06:28,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {32903#(and (= |main_~#vogal_array~0.offset| 0) (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))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {32931#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:06:28,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {32931#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32935#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:06:28,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {32935#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32939#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~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| 1)) |main_#t~mem8|))} is VALID [2022-04-28 09:06:28,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {32939#(and (= |main_~#vogal_array~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~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| 1)) |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; {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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; {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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; {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,942 INFO L290 TraceCheckUtils]: 39: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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; {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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); {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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; {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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); {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {32943#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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; {32968#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {32968#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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 + ~i~0 % 4294967296, 1); {32968#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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-28 09:06:28,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {32968#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (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))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {32975#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {32975#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32979#(and (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)))) (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) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) |main_#t~mem13|))} is VALID [2022-04-28 09:06:28,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {32979#(and (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)))) (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) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) |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; {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:28,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {32983#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (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|) 0)))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {33002#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)))))} is VALID [2022-04-28 09:06:28,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {33002#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) 0)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (exists ((|main_~#vogal_array~0.base| Int)) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {33006#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:06:28,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {33006#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {32816#false} is VALID [2022-04-28 09:06:28,951 INFO L272 TraceCheckUtils]: 56: Hoare triple {32816#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {32816#false} is VALID [2022-04-28 09:06:28,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-28 09:06:28,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-28 09:06:28,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-28 09:06:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:06:28,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:06:32,037 INFO L356 Elim1Store]: treesize reduction 54, result has 28.9 percent of original size [2022-04-28 09:06:32,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 37 [2022-04-28 09:06:32,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-28 09:06:32,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-28 09:06:32,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-28 09:06:32,108 INFO L272 TraceCheckUtils]: 56: Hoare triple {32816#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {32816#false} is VALID [2022-04-28 09:06:32,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {33006#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {32816#false} is VALID [2022-04-28 09:06:32,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {33037#(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 + ~i~0 % 4294967296, 1); {33006#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:06:32,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {33037#(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-28 09:06:32,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {33060#(or (not (= |main_#t~mem14| |main_#t~mem13|)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {33041#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:32,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {33064#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)) (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|)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33060#(or (not (= |main_#t~mem14| |main_#t~mem13|)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)))} is VALID [2022-04-28 09:06:32,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {33068#(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 (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {33064#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)) (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|)))))} is VALID [2022-04-28 09:06:32,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {33068#(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 (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {33068#(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 (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)))} is VALID [2022-04-28 09:06:32,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} ~i~0 := 0;~cont_aux~0 := 0; {33068#(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 (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)))} is VALID [2022-04-28 09:06:32,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume !(~j~0 % 4294967296 < 2); {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {33100#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {33075#(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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {33104#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (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|)))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33100#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {33108#(or (forall ((|main_~#vogal_array~0.base| Int)) (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 (= (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|))))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {33104#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (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|)))))))} is VALID [2022-04-28 09:06:32,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33108#(or (forall ((|main_~#vogal_array~0.base| Int)) (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 (= (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|))))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)))} is VALID [2022-04-28 09:06:32,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} assume !(~j~0 % 4294967296 < 2); {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (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; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} ~cont~0 := 0;~i~0 := 0; {33112#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} assume !(0 != #t~mem4);havoc #t~mem4; {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~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 + ~n_caracter~0 % 4294967296, 1); {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {33150#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))) (= |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; {33140#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))))} is VALID [2022-04-28 09:06:32,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {33154#(or (= (mod main_~n_caracter~0 4294967296) 1) (= (mod main_~n_caracter~0 4294967296) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {33150#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (forall ((|main_~#vogal_array~0.base| Int)) (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|))) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {32815#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {33154#(or (= (mod main_~n_caracter~0 4294967296) 1) (= (mod main_~n_caracter~0 4294967296) 0))} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {32815#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {32815#true} assume !(~i~0 % 4294967296 < 5); {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {32815#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32815#true} is VALID [2022-04-28 09:06:32,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {32815#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {32815#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; {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {32815#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); {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {32815#true} call ULTIMATE.init(); {32815#true} is VALID [2022-04-28 09:06:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 09:06:32,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747752886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:06:32,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:06:32,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 37 [2022-04-28 09:06:32,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:06:32,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150558923] [2022-04-28 09:06:32,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150558923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:06:32,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:06:32,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:06:32,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491948732] [2022-04-28 09:06:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:06:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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 60 [2022-04-28 09:06:32,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:06:32,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-28 09:06:32,162 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-28 09:06:32,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:06:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:06:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1154, Unknown=4, NotChecked=0, Total=1332 [2022-04-28 09:06:32,163 INFO L87 Difference]: Start difference. First operand 354 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-28 09:06:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:35,501 INFO L93 Difference]: Finished difference Result 537 states and 620 transitions. [2022-04-28 09:06:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:06:35,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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 60 [2022-04-28 09:06:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:06:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-28 09:06:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 09:06:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-28 09:06:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 09:06:35,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 09:06:35,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:35,589 INFO L225 Difference]: With dead ends: 537 [2022-04-28 09:06:35,589 INFO L226 Difference]: Without dead ends: 348 [2022-04-28 09:06:35,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=202, Invalid=1434, Unknown=4, NotChecked=0, Total=1640 [2022-04-28 09:06:35,590 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 133 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:06:35,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 50 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:06:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-28 09:06:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 284. [2022-04-28 09:06:37,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:06:37,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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-28 09:06:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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-28 09:06:37,858 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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-28 09:06:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:37,862 INFO L93 Difference]: Finished difference Result 348 states and 402 transitions. [2022-04-28 09:06:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 402 transitions. [2022-04-28 09:06:37,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:37,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:37,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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 348 states. [2022-04-28 09:06:37,863 INFO L87 Difference]: Start difference. First operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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 348 states. [2022-04-28 09:06:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:37,867 INFO L93 Difference]: Finished difference Result 348 states and 402 transitions. [2022-04-28 09:06:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 402 transitions. [2022-04-28 09:06:37,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:37,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:37,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:06:37,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:06:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.1720430107526882) internal successors, (327), 279 states have internal predecessors, (327), 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-28 09:06:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 331 transitions. [2022-04-28 09:06:37,871 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 331 transitions. Word has length 60 [2022-04-28 09:06:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:06:37,871 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 331 transitions. [2022-04-28 09:06:37,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 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-28 09:06:37,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 284 states and 331 transitions. [2022-04-28 09:06:39,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 331 transitions. [2022-04-28 09:06:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 09:06:39,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:06:39,142 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 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] [2022-04-28 09:06:39,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 09:06:39,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:39,343 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:06:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:06:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1971018387, now seen corresponding path program 5 times [2022-04-28 09:06:39,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:39,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505017511] [2022-04-28 09:06:39,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:06:39,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:06:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1971018387, now seen corresponding path program 6 times [2022-04-28 09:06:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:06:39,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100790327] [2022-04-28 09:06:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:06:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:06:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:06:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:39,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {35575#(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); {35560#true} is VALID [2022-04-28 09:06:39,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-28 09:06:39,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-28 09:06:39,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {35560#true} call ULTIMATE.init(); {35575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:06:39,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {35575#(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); {35560#true} is VALID [2022-04-28 09:06:39,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-28 09:06:39,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-28 09:06:39,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-28 09:06:39,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {35560#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; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:39,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {35566#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(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 + ~n_caracter~0 % 4294967296, 1); {35566#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(and (= main_~n_caracter~0 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; {35567#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {35567#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {35568#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (or (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296))))) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))))} is VALID [2022-04-28 09:06:39,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {35568#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (or (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296))))) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))))} assume !(0 != #t~mem4);havoc #t~mem4; {35569#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {35569#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {35569#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {35569#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (not (= (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~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; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:39,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {35570#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296)))) 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:39,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:39,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35573#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:06:39,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {35573#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35574#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem11| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {35574#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem11| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {35561#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; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {35561#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {35561#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35561#false} is VALID [2022-04-28 09:06:39,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {35561#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L272 TraceCheckUtils]: 57: Hoare triple {35561#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-28 09:06:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 09:06:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:06:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100790327] [2022-04-28 09:06:39,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100790327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:06:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779554989] [2022-04-28 09:06:39,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:06:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:06:39,735 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:06:39,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 09:06:39,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:06:39,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:06:39,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 09:06:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:39,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:06:40,082 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-28 09:06:40,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {35560#true} call ULTIMATE.init(); {35560#true} is VALID [2022-04-28 09:06:40,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {35560#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); {35560#true} is VALID [2022-04-28 09:06:40,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-28 09:06:40,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-28 09:06:40,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-28 09:06:40,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {35560#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; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {35565#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {35565#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:40,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {35565#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {35566#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(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 + ~n_caracter~0 % 4294967296, 1); {35566#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(and (= main_~n_caracter~0 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; {35639#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {35639#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {35643#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} is VALID [2022-04-28 09:06:40,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {35643#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} assume !(0 != #t~mem4);havoc #t~mem4; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:40,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {35571#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:40,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {35572#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35713#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:06:40,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {35713#(and (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35717#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {35717#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {35561#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; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {35561#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 54: Hoare triple {35561#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {35561#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L272 TraceCheckUtils]: 57: Hoare triple {35561#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {35561#false} is VALID [2022-04-28 09:06:40,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-28 09:06:40,122 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-28 09:06:40,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-28 09:06:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:06:40,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:06:40,262 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:06:40,262 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 22 treesize of output 13 [2022-04-28 09:06:40,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-28 09:06:40,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-28 09:06:40,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L272 TraceCheckUtils]: 57: Hoare triple {35561#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {35561#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {35561#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {35561#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {35561#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {35561#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; {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {35561#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35561#false} is VALID [2022-04-28 09:06:40,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {35717#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35561#false} is VALID [2022-04-28 09:06:40,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {35808#(= (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 + ~i~0 % 4294967296, 1); {35717#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:06:40,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {35808#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0)} is VALID [2022-04-28 09:06:40,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !(~j~0 % 4294967296 < 2); {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} ~i~0 := 0;~cont_aux~0 := 0; {35812#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:06:40,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !(~j~0 % 4294967296 < 2); {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} ~cont~0 := 0;~i~0 := 0; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {35880#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (= |main_#t~mem4| 0)))} assume !(0 != #t~mem4);havoc #t~mem4; {35843#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:06:40,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {35884#(= (mod main_~n_caracter~0 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {35880#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (= |main_#t~mem4| 0)))} is VALID [2022-04-28 09:06:40,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {35888#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {35884#(= (mod main_~n_caracter~0 4294967296) 1)} is VALID [2022-04-28 09:06:40,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {35888#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {35888#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {35560#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {35888#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {35560#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {35560#true} assume !(~i~0 % 4294967296 < 5); {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {35560#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {35560#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {35560#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {35560#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {35560#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {35560#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {35560#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {35560#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {35560#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35560#true} is VALID [2022-04-28 09:06:40,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {35560#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {35560#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; {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {35560#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); {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {35560#true} call ULTIMATE.init(); {35560#true} is VALID [2022-04-28 09:06:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:06:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779554989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:06:40,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:06:40,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 23 [2022-04-28 09:06:40,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:06:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505017511] [2022-04-28 09:06:40,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505017511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:06:40,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:06:40,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:06:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405546452] [2022-04-28 09:06:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:06:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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 61 [2022-04-28 09:06:40,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:06:40,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-28 09:06:40,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:06:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:06:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:06:40,377 INFO L87 Difference]: Start difference. First operand 284 states and 331 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-28 09:06:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:43,620 INFO L93 Difference]: Finished difference Result 338 states and 389 transitions. [2022-04-28 09:06:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:06:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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 61 [2022-04-28 09:06:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:06:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-28 09:06:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 09:06:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-28 09:06:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 09:06:43,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 09:06:43,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:43,698 INFO L225 Difference]: With dead ends: 338 [2022-04-28 09:06:43,699 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 09:06:43,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:06:43,700 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 118 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:06:43,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 51 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:06:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 09:06:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-04-28 09:06:45,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:06:45,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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-28 09:06:45,749 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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-28 09:06:45,749 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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-28 09:06:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:45,752 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2022-04-28 09:06:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-28 09:06:45,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:45,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:45,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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 262 states. [2022-04-28 09:06:45,756 INFO L87 Difference]: Start difference. First operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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 262 states. [2022-04-28 09:06:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:06:45,758 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2022-04-28 09:06:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-28 09:06:45,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:06:45,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:06:45,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:06:45,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:06:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.1750972762645915) internal successors, (302), 257 states have internal predecessors, (302), 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-28 09:06:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2022-04-28 09:06:45,762 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 61 [2022-04-28 09:06:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:06:45,762 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2022-04-28 09:06:45,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-28 09:06:45,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 306 transitions. [2022-04-28 09:06:46,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-28 09:06:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 09:06:46,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:06:46,870 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 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] [2022-04-28 09:06:46,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 09:06:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:47,071 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:06:47,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:06:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -891810688, now seen corresponding path program 7 times [2022-04-28 09:06:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:47,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125798484] [2022-04-28 09:06:47,076 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:06:47,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:06:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash -891810688, now seen corresponding path program 8 times [2022-04-28 09:06:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:06:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618663593] [2022-04-28 09:06:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:06:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:06:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:06:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:47,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {37718#(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); {37693#true} is VALID [2022-04-28 09:06:47,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-28 09:06:47,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-28 09:06:47,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {37693#true} call ULTIMATE.init(); {37718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:06:47,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {37718#(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); {37693#true} is VALID [2022-04-28 09:06:47,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-28 09:06:47,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-28 09:06:47,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-28 09:06:47,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {37693#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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {37698#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {37698#(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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {37698#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {37698#(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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {37698#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {37698#(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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {37698#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {37698#(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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {37698#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {37698#(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; {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {37698#(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); {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {37698#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {37699#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {37699#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37699#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {37699#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {37700#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:06:47,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {37700#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37700#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:06:47,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {37700#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} assume !(0 != #t~mem4);havoc #t~mem4; {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {37701#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} ~cont~0 := 0;~i~0 := 0; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(~j~0 % 4294967296 < 2); {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:06:47,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {37702#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37703#(and (or (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (and (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {37703#(and (or (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (and (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37704#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {37704#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37705#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {37705#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~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; {37706#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {37706#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (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; {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (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; {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:06:47,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {37707#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37708#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {37708#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {37708#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:47,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {37708#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {37709#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {37709#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {37710#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem11| (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 0))} is VALID [2022-04-28 09:06:47,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {37710#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem11| (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 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {37711#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))))))} is VALID [2022-04-28 09:06:47,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {37711#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37712#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#input_string~0.base|) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= |main_#t~mem13| 0)))} is VALID [2022-04-28 09:06:47,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {37712#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#input_string~0.base|) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= |main_#t~mem13| 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; {37713#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {37713#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37714#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {37714#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:47,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {37716#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:06:47,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {37716#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {37717#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:06:47,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {37717#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {37694#false} is VALID [2022-04-28 09:06:47,869 INFO L272 TraceCheckUtils]: 58: Hoare triple {37694#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {37694#false} is VALID [2022-04-28 09:06:47,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-28 09:06:47,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-28 09:06:47,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-28 09:06:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:06:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:06:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618663593] [2022-04-28 09:06:47,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618663593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:06:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129297106] [2022-04-28 09:06:47,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:06:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:06:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:06:47,871 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:06:47,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 09:06:47,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:06:47,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:06:47,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:06:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:06:47,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:06:48,331 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-28 09:06:48,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {37693#true} call ULTIMATE.init(); {37693#true} is VALID [2022-04-28 09:06:48,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {37693#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); {37693#true} is VALID [2022-04-28 09:06:48,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-28 09:06:48,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-28 09:06:48,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-28 09:06:48,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {37693#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; {37737#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {37737#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37737#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {37737#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {37744#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {37744#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {37744#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {37744#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {37744#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:06:48,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {37744#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {37778#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {37778#(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 + ~n_caracter~0 % 4294967296, 1); {37778#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {37778#(and (= main_~n_caracter~0 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; {37785#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {37785#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37789#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} is VALID [2022-04-28 09:06:48,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {37789#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:06:48,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {37793#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,355 INFO L290 TraceCheckUtils]: 48: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~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; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:06:48,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {37715#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {37893#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:06:48,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {37893#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {37717#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:06:48,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {37717#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {37694#false} is VALID [2022-04-28 09:06:48,358 INFO L272 TraceCheckUtils]: 58: Hoare triple {37694#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {37694#false} is VALID [2022-04-28 09:06:48,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-28 09:06:48,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-28 09:06:48,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-28 09:06:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 09:06:48,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:06:48,535 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:06:48,536 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 22 treesize of output 13 [2022-04-28 09:06:48,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-28 09:06:48,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-28 09:06:48,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-28 09:06:48,602 INFO L272 TraceCheckUtils]: 58: Hoare triple {37694#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {37694#false} is VALID [2022-04-28 09:06:48,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {37717#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {37694#false} is VALID [2022-04-28 09:06:48,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {37927#(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 + ~i~0 % 4294967296, 1); {37717#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:06:48,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {37927#(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-28 09:06:48,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {37931#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:06:48,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~j~0 % 4294967296 < 2); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~j~0 % 4294967296 < 2); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~cont~0 := 0;~i~0 := 0; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {38032#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {37962#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:06:48,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {38036#(= (mod main_~n_caracter~0 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {38032#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:06:48,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {38040#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {38036#(= (mod main_~n_caracter~0 4294967296) 1)} is VALID [2022-04-28 09:06:48,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {38040#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {38040#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {37693#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {38040#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {37693#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {37693#true} assume !(~i~0 % 4294967296 < 5); {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {37693#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {37693#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {37693#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {37693#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {37693#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {37693#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {37693#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#true} is VALID [2022-04-28 09:06:48,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {37693#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {37693#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {37693#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {37693#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; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {37693#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); {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {37693#true} call ULTIMATE.init(); {37693#true} is VALID [2022-04-28 09:06:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 09:06:48,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129297106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:06:48,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:06:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 9] total 36 [2022-04-28 09:06:48,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:06:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125798484] [2022-04-28 09:06:48,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125798484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:06:48,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:06:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 09:06:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664121485] [2022-04-28 09:06:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:06:48,617 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 62 [2022-04-28 09:06:48,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:06:48,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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-28 09:06:48,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:06:48,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 09:06:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:06:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 09:06:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:06:48,660 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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-28 09:07:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:00,505 INFO L93 Difference]: Finished difference Result 1095 states and 1285 transitions. [2022-04-28 09:07:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 09:07:00,505 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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 62 [2022-04-28 09:07:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:07:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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-28 09:07:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2022-04-28 09:07:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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-28 09:07:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2022-04-28 09:07:00,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 201 transitions. [2022-04-28 09:07:00,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:00,723 INFO L225 Difference]: With dead ends: 1095 [2022-04-28 09:07:00,723 INFO L226 Difference]: Without dead ends: 922 [2022-04-28 09:07:00,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=501, Invalid=2805, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:07:00,725 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 239 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:07:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 92 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 09:07:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-04-28 09:07:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 375. [2022-04-28 09:07:03,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:07:03,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 922 states. Second operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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-28 09:07:03,940 INFO L74 IsIncluded]: Start isIncluded. First operand 922 states. Second operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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-28 09:07:03,940 INFO L87 Difference]: Start difference. First operand 922 states. Second operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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-28 09:07:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:03,968 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2022-04-28 09:07:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1072 transitions. [2022-04-28 09:07:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:03,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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 922 states. [2022-04-28 09:07:03,969 INFO L87 Difference]: Start difference. First operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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 922 states. [2022-04-28 09:07:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:03,991 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2022-04-28 09:07:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1072 transitions. [2022-04-28 09:07:03,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:03,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:03,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:07:03,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:07:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.164864864864865) internal successors, (431), 370 states have internal predecessors, (431), 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-28 09:07:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2022-04-28 09:07:03,998 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 62 [2022-04-28 09:07:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:07:03,999 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2022-04-28 09:07:03,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 states have internal predecessors, (48), 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-28 09:07:03,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 435 transitions. [2022-04-28 09:07:05,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2022-04-28 09:07:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 09:07:05,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:07:05,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 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] [2022-04-28 09:07:05,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 09:07:05,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 09:07:05,943 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:07:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:07:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -970116796, now seen corresponding path program 9 times [2022-04-28 09:07:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:05,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688674938] [2022-04-28 09:07:05,948 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:07:05,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:07:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -970116796, now seen corresponding path program 10 times [2022-04-28 09:07:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:07:05,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322241198] [2022-04-28 09:07:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:07:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:07:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:07:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:06,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {42944#(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); {42931#true} is VALID [2022-04-28 09:07:06,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-28 09:07:06,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-28 09:07:06,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {42931#true} call ULTIMATE.init(); {42944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:07:06,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {42944#(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); {42931#true} is VALID [2022-04-28 09:07:06,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-28 09:07:06,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-28 09:07:06,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-28 09:07:06,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {42931#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; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {42937#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:06,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {42937#(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 + ~n_caracter~0 % 4294967296, 1); {42937#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:06,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {42937#(and (= main_~n_caracter~0 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; {42938#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:07:06,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {42938#(and (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {42939#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296))))) (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:07:06,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {42939#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~n_caracter~0 |main_~#input_string~0.offset| (* (- 4294967296) (div main_~n_caracter~0 4294967296))))) (<= (+ main_~n_caracter~0 |main_~#input_string~0.offset|) (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) 1)) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~n_caracter~0 |main_~#input_string~0.offset|)))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(0 != #t~mem4);havoc #t~mem4; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} ~cont~0 := 0;~i~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~j~0 % 4294967296 < 2); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~j~0 % 4294967296 < 2); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} ~i~0 := 0;~cont_aux~0 := 0; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~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; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {42942#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:07:06,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {42942#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {42943#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:06,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {42943#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {42932#false} is VALID [2022-04-28 09:07:06,202 INFO L272 TraceCheckUtils]: 58: Hoare triple {42932#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {42932#false} is VALID [2022-04-28 09:07:06,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-28 09:07:06,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-28 09:07:06,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-28 09:07:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 09:07:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:07:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322241198] [2022-04-28 09:07:06,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322241198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:07:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740024894] [2022-04-28 09:07:06,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:07:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:07:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:07:06,204 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:07:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 09:07:06,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:07:06,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:07:06,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 09:07:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:06,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:07:06,599 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-28 09:07:06,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {42931#true} call ULTIMATE.init(); {42931#true} is VALID [2022-04-28 09:07:06,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {42931#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); {42931#true} is VALID [2022-04-28 09:07:06,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-28 09:07:06,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-28 09:07:06,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-28 09:07:06,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {42931#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; {42963#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {42963#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42963#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {42963#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {42936#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {42936#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:06,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {42936#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {42937#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:06,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {42937#(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 + ~n_caracter~0 % 4294967296, 1); {42937#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:06,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {42937#(and (= main_~n_caracter~0 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; {43009#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:06,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {43009#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {43013#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} is VALID [2022-04-28 09:07:06,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {43013#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem4|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(0 != #t~mem4);havoc #t~mem4; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} ~cont~0 := 0;~i~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~j~0 % 4294967296 < 2); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~j~0 % 4294967296 < 2); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {42940#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} ~i~0 := 0;~cont_aux~0 := 0; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~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; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} is VALID [2022-04-28 09:07:06,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {42941#(and (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {43116#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} is VALID [2022-04-28 09:07:06,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {43116#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) 0)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {42943#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:06,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {42943#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {42932#false} is VALID [2022-04-28 09:07:06,636 INFO L272 TraceCheckUtils]: 58: Hoare triple {42932#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {42932#false} is VALID [2022-04-28 09:07:06,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-28 09:07:06,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-28 09:07:06,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-28 09:07:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 09:07:06,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:07:06,799 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:07:06,800 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 22 treesize of output 13 [2022-04-28 09:07:06,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-28 09:07:06,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-28 09:07:06,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-28 09:07:06,854 INFO L272 TraceCheckUtils]: 58: Hoare triple {42932#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {42932#false} is VALID [2022-04-28 09:07:06,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {42943#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {42932#false} is VALID [2022-04-28 09:07:06,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {43150#(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 + ~i~0 % 4294967296, 1); {42943#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:06,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {43150#(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-28 09:07:06,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {43154#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:06,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~j~0 % 4294967296 < 2); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(~j~0 % 4294967296 < 2); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} ~cont~0 := 0;~i~0 := 0; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {43255#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 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; {43185#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0))} is VALID [2022-04-28 09:07:06,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {43259#(= (mod main_~n_caracter~0 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {43255#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:07:06,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {43263#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {43259#(= (mod main_~n_caracter~0 4294967296) 1)} is VALID [2022-04-28 09:07:06,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {43263#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {43263#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {42931#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {43263#(= (mod (+ main_~n_caracter~0 1) 4294967296) 1)} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {42931#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {42931#true} assume !(~i~0 % 4294967296 < 5); {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {42931#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {42931#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {42931#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {42931#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {42931#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {42931#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {42931#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {42931#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {42931#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {42931#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {42931#true} is VALID [2022-04-28 09:07:06,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {42931#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; {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {42931#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); {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {42931#true} call ULTIMATE.init(); {42931#true} is VALID [2022-04-28 09:07:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-28 09:07:06,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740024894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:07:06,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:07:06,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2022-04-28 09:07:06,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:07:06,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688674938] [2022-04-28 09:07:06,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688674938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:07:06,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:07:06,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:07:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231173499] [2022-04-28 09:07:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:07:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 62 [2022-04-28 09:07:06,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:07:06,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:07:06,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:06,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:07:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:06,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:07:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:07:06,897 INFO L87 Difference]: Start difference. First operand 375 states and 435 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:07:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:12,232 INFO L93 Difference]: Finished difference Result 507 states and 586 transitions. [2022-04-28 09:07:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:07:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 62 [2022-04-28 09:07:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:07:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:07:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-28 09:07:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:07:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-28 09:07:12,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-28 09:07:12,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:12,329 INFO L225 Difference]: With dead ends: 507 [2022-04-28 09:07:12,329 INFO L226 Difference]: Without dead ends: 502 [2022-04-28 09:07:12,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:07:12,330 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 150 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:07:12,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 51 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:07:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-28 09:07:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 370. [2022-04-28 09:07:15,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:07:15,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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-28 09:07:15,594 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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-28 09:07:15,594 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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-28 09:07:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:15,601 INFO L93 Difference]: Finished difference Result 502 states and 579 transitions. [2022-04-28 09:07:15,602 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 579 transitions. [2022-04-28 09:07:15,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:15,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:15,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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 502 states. [2022-04-28 09:07:15,602 INFO L87 Difference]: Start difference. First operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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 502 states. [2022-04-28 09:07:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:15,610 INFO L93 Difference]: Finished difference Result 502 states and 579 transitions. [2022-04-28 09:07:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 579 transitions. [2022-04-28 09:07:15,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:15,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:15,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:07:15,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:07:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 365 states have (on average 1.167123287671233) internal successors, (426), 365 states have internal predecessors, (426), 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-28 09:07:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 430 transitions. [2022-04-28 09:07:15,616 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 430 transitions. Word has length 62 [2022-04-28 09:07:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:07:15,616 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 430 transitions. [2022-04-28 09:07:15,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-28 09:07:15,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 430 transitions. [2022-04-28 09:07:17,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 430 transitions. [2022-04-28 09:07:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 09:07:17,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:07:17,363 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 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] [2022-04-28 09:07:17,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 09:07:17,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 09:07:17,576 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:07:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:07:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 475673560, now seen corresponding path program 11 times [2022-04-28 09:07:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:17,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636258925] [2022-04-28 09:07:17,580 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:07:17,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:07:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 475673560, now seen corresponding path program 12 times [2022-04-28 09:07:17,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:07:17,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243488134] [2022-04-28 09:07:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:07:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:07:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:07:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:17,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {46111#(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); {46100#true} is VALID [2022-04-28 09:07:17,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {46100#true} call ULTIMATE.init(); {46111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:07:17,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {46111#(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); {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {46100#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; {46100#true} is VALID [2022-04-28 09:07:17,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {46100#true} assume !(~i~0 % 4294967296 < 5); {46100#true} is VALID [2022-04-28 09:07:17,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {46100#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {46100#true} is VALID [2022-04-28 09:07:17,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {46100#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {46105#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:17,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {46105#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46105#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:17,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {46105#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {46106#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:17,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {46106#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46106#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:17,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {46106#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:17,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:17,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !(0 != #t~mem4);havoc #t~mem4; {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:17,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {46107#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} ~cont~0 := 0;~i~0 := 0; {46108#(and (<= 2 main_~n_caracter~0) (= main_~i~0 0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:17,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {46108#(and (<= 2 main_~n_caracter~0) (= main_~i~0 0) (<= main_~n_caracter~0 2))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~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; {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:17,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {46109#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {46110#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~n_caracter~0))} is VALID [2022-04-28 09:07:17,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {46110#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {46101#false} is VALID [2022-04-28 09:07:17,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-28 09:07:17,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {46101#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; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {46101#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {46101#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {46101#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; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {46101#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {46101#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {46101#false} assume !(0 != #t~mem11);havoc #t~mem11; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L272 TraceCheckUtils]: 59: Hoare triple {46101#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-28 09:07:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:07:17,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:07:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243488134] [2022-04-28 09:07:17,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243488134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:07:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266847802] [2022-04-28 09:07:17,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:07:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:07:17,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:07:17,694 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:07:17,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 09:07:17,798 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:07:17,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:07:17,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 09:07:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:17,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:07:18,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {46100#true} call ULTIMATE.init(); {46100#true} is VALID [2022-04-28 09:07:18,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {46100#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); {46100#true} is VALID [2022-04-28 09:07:18,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-28 09:07:18,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-28 09:07:18,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-28 09:07:18,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {46100#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; {46130#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:18,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {46130#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46130#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:18,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {46130#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46137#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {46137#(and (= main_~i~0 1) (= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46137#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {46137#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {46144#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {46144#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {46144#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {46144#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:18,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {46144#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {46172#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {46172#(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 + ~n_caracter~0 % 4294967296, 1); {46172#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {46172#(and (= main_~n_caracter~0 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; {46179#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {46179#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46179#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:18,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {46179#(and (= (+ (- 1) main_~n_caracter~0) 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; {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} assume !(0 != #t~mem4);havoc #t~mem4; {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {46186#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} ~cont~0 := 0;~i~0 := 0; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} assume !(~j~0 % 4294967296 < 2); {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {46196#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= main_~n_caracter~0 2))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {46224#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {46224#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {46101#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; {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {46101#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46101#false} is VALID [2022-04-28 09:07:18,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {46101#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {46101#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; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {46101#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {46101#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {46101#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {46101#false} assume !(0 != #t~mem11);havoc #t~mem11; {46101#false} is VALID [2022-04-28 09:07:18,102 INFO L272 TraceCheckUtils]: 59: Hoare triple {46101#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {46101#false} is VALID [2022-04-28 09:07:18,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-28 09:07:18,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-28 09:07:18,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-28 09:07:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 09:07:18,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:07:18,201 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-04-28 09:07:18,202 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 8 [2022-04-28 09:07:18,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-28 09:07:18,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-28 09:07:18,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-28 09:07:18,488 INFO L272 TraceCheckUtils]: 59: Hoare triple {46101#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {46101#false} is VALID [2022-04-28 09:07:18,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {46321#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {46101#false} is VALID [2022-04-28 09:07:18,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {46325#(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 + ~i~0 % 4294967296, 1); {46321#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:18,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46325#(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-28 09:07:18,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {46354#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)) (= |main_#t~mem11| 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46329#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:18,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46354#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)) (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:18,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {46101#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {46101#false} is VALID [2022-04-28 09:07:18,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-28 09:07:18,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {46101#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46101#false} is VALID [2022-04-28 09:07:18,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {46101#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {46101#false} is VALID [2022-04-28 09:07:18,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {46373#(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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {46373#(not (< (mod main_~j~0 4294967296) 2))} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} 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; {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46377#(not (< (mod (+ main_~j~0 1) 4294967296) 2))} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {46101#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {46101#false} is VALID [2022-04-28 09:07:18,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-28 09:07:18,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {46396#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {46101#false} is VALID [2022-04-28 09:07:18,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {46396#(< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(~j~0 % 4294967296 < 2); {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {46425#(or (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {46400#(< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:18,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} ~cont~0 := 0;~i~0 := 0; {46425#(or (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:07:18,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} assume !(0 != #t~mem4);havoc #t~mem4; {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:07:18,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:07:18,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {46439#(or (not (< 0 (mod (+ main_~n_caracter~0 1) 4294967296))) (< 1 (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; {46429#(or (< 1 (mod main_~n_caracter~0 4294967296)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:07:18,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {46439#(or (not (< 0 (mod (+ main_~n_caracter~0 1) 4294967296))) (< 1 (mod (+ main_~n_caracter~0 1) 4294967296)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46439#(or (not (< 0 (mod (+ main_~n_caracter~0 1) 4294967296))) (< 1 (mod (+ main_~n_caracter~0 1) 4294967296)))} is VALID [2022-04-28 09:07:18,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {46446#(or (< 1 (mod (+ main_~n_caracter~0 2) 4294967296)) (not (< 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; {46439#(or (not (< 0 (mod (+ main_~n_caracter~0 1) 4294967296))) (< 1 (mod (+ main_~n_caracter~0 1) 4294967296)))} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {46446#(or (< 1 (mod (+ main_~n_caracter~0 2) 4294967296)) (not (< 0 (mod (+ main_~n_caracter~0 2) 4294967296))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {46446#(or (< 1 (mod (+ main_~n_caracter~0 2) 4294967296)) (not (< 0 (mod (+ main_~n_caracter~0 2) 4294967296))))} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {46100#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {46446#(or (< 1 (mod (+ main_~n_caracter~0 2) 4294967296)) (not (< 0 (mod (+ main_~n_caracter~0 2) 4294967296))))} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {46100#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {46100#true} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {46100#true} assume !(~i~0 % 4294967296 < 5); {46100#true} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:18,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {46100#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {46100#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {46100#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; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {46100#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); {46100#true} is VALID [2022-04-28 09:07:18,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {46100#true} call ULTIMATE.init(); {46100#true} is VALID [2022-04-28 09:07:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:07:18,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266847802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:07:18,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:07:18,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 29 [2022-04-28 09:07:18,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:07:18,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636258925] [2022-04-28 09:07:18,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636258925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:07:18,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:07:18,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:07:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663331191] [2022-04-28 09:07:18,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:07:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 63 [2022-04-28 09:07:18,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:07:18,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-28 09:07:18,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:18,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:07:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:07:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:07:18,542 INFO L87 Difference]: Start difference. First operand 370 states and 430 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-28 09:07:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:25,696 INFO L93 Difference]: Finished difference Result 739 states and 855 transitions. [2022-04-28 09:07:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:07:25,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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 63 [2022-04-28 09:07:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:07:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-28 09:07:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 09:07:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-28 09:07:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 09:07:25,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-28 09:07:25,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:25,806 INFO L225 Difference]: With dead ends: 739 [2022-04-28 09:07:25,806 INFO L226 Difference]: Without dead ends: 690 [2022-04-28 09:07:25,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:07:25,807 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:07:25,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 67 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:07:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-04-28 09:07:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 370. [2022-04-28 09:07:29,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:07:29,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 690 states. Second operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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-28 09:07:29,159 INFO L74 IsIncluded]: Start isIncluded. First operand 690 states. Second operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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-28 09:07:29,159 INFO L87 Difference]: Start difference. First operand 690 states. Second operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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-28 09:07:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:29,171 INFO L93 Difference]: Finished difference Result 690 states and 799 transitions. [2022-04-28 09:07:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 799 transitions. [2022-04-28 09:07:29,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:29,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:29,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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 690 states. [2022-04-28 09:07:29,172 INFO L87 Difference]: Start difference. First operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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 690 states. [2022-04-28 09:07:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:29,202 INFO L93 Difference]: Finished difference Result 690 states and 799 transitions. [2022-04-28 09:07:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 799 transitions. [2022-04-28 09:07:29,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:29,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:29,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:07:29,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:07:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 365 states have (on average 1.158904109589041) internal successors, (423), 365 states have internal predecessors, (423), 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-28 09:07:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 427 transitions. [2022-04-28 09:07:29,209 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 427 transitions. Word has length 63 [2022-04-28 09:07:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:07:29,209 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 427 transitions. [2022-04-28 09:07:29,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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-28 09:07:29,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 427 transitions. [2022-04-28 09:07:30,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 427 transitions. [2022-04-28 09:07:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 09:07:30,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:07:30,996 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 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] [2022-04-28 09:07:31,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 09:07:31,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 09:07:31,197 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:07:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:07:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2031628323, now seen corresponding path program 13 times [2022-04-28 09:07:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:31,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988395715] [2022-04-28 09:07:31,201 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:07:31,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:07:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2031628323, now seen corresponding path program 14 times [2022-04-28 09:07:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:07:31,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805872187] [2022-04-28 09:07:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:07:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:07:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:07:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:31,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {50129#(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); {50117#true} is VALID [2022-04-28 09:07:31,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-28 09:07:31,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-28 09:07:31,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {50117#true} call ULTIMATE.init(); {50129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:07:31,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {50129#(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); {50117#true} is VALID [2022-04-28 09:07:31,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-28 09:07:31,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {50117#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; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:31,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:31,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:31,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {50117#true} assume !(~i~0 % 4294967296 < 5); {50117#true} is VALID [2022-04-28 09:07:31,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {50117#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {50117#true} is VALID [2022-04-28 09:07:31,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {50117#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {50122#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:31,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {50122#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50122#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:31,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {50122#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {50123#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {50123#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50123#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {50123#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {50124#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:31,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {50124#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50124#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:31,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {50124#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {50125#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {50126#(and (<= main_~n_caracter~0 3) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {50126#(and (<= main_~n_caracter~0 3) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !(~j~0 % 4294967296 < 2); {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {50127#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {50128#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~n_caracter~0))} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {50128#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {50118#false} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {50118#false} ~i~0 := 0;~cont_aux~0 := 0; {50118#false} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {50118#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {50118#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50118#false} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {50118#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {50118#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; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {50118#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {50118#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {50118#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {50118#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {50118#false} assume !(~j~0 % 4294967296 < 2); {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {50118#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {50118#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {50118#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {50118#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {50118#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; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {50118#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {50118#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {50118#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {50118#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50118#false} is VALID [2022-04-28 09:07:31,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {50118#false} assume !(~j~0 % 4294967296 < 2); {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {50118#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {50118#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {50118#false} assume !(0 != #t~mem11);havoc #t~mem11; {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L272 TraceCheckUtils]: 61: Hoare triple {50118#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-28 09:07:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:07:31,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:07:31,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805872187] [2022-04-28 09:07:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805872187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:07:31,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806695995] [2022-04-28 09:07:31,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:07:31,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:07:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:07:31,341 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:07:31,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 09:07:31,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:07:31,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:07:31,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:07:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:31,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:07:31,909 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-28 09:07:31,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {50117#true} call ULTIMATE.init(); {50117#true} is VALID [2022-04-28 09:07:31,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {50117#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); {50117#true} is VALID [2022-04-28 09:07:31,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-28 09:07:31,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-28 09:07:31,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-28 09:07:31,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {50117#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; {50148#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {50148#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50148#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {50148#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50155#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:31,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {50155#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50155#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:31,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {50155#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {50162#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {50162#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {50162#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {50162#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:31,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {50162#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {50190#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {50190#(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 + ~n_caracter~0 % 4294967296, 1); {50190#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {50190#(and (= main_~n_caracter~0 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; {50197#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {50197#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50197#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {50197#(and (= (+ (- 1) main_~n_caracter~0) 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; {50204#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:31,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {50204#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50208#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:07:31,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {50208#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {50212#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:31,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {50255#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 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; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {50286#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50317#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:31,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {50317#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50321#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:31,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {50321#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {50118#false} is VALID [2022-04-28 09:07:31,947 INFO L272 TraceCheckUtils]: 61: Hoare triple {50118#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {50118#false} is VALID [2022-04-28 09:07:31,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-28 09:07:31,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-28 09:07:31,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-28 09:07:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 09:07:31,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:07:32,174 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:07:32,175 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 22 treesize of output 13 [2022-04-28 09:07:32,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-28 09:07:32,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-28 09:07:32,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-28 09:07:32,265 INFO L272 TraceCheckUtils]: 61: Hoare triple {50118#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {50118#false} is VALID [2022-04-28 09:07:32,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {50321#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {50118#false} is VALID [2022-04-28 09:07:32,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {50352#(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 + ~i~0 % 4294967296, 1); {50321#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:32,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50352#(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-28 09:07:32,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {50356#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:32,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {50387#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {50461#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {50418#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:32,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {50465#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50461#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:07:32,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {50469#(= 2 (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; {50465#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:32,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {50469#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50469#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:07:32,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {50476#(= 2 (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; {50469#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:07:32,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {50476#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {50476#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {50117#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {50476#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {50117#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {50117#true} assume !(~i~0 % 4294967296 < 5); {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {50117#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50117#true} is VALID [2022-04-28 09:07:32,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {50117#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {50117#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; {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {50117#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); {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {50117#true} call ULTIMATE.init(); {50117#true} is VALID [2022-04-28 09:07:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:07:32,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806695995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:07:32,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:07:32,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 30 [2022-04-28 09:07:32,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:07:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988395715] [2022-04-28 09:07:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988395715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:07:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:07:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:07:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102027013] [2022-04-28 09:07:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:07:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 65 [2022-04-28 09:07:32,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:07:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:07:32,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:32,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:07:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:07:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:07:32,310 INFO L87 Difference]: Start difference. First operand 370 states and 427 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:07:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:42,823 INFO L93 Difference]: Finished difference Result 1028 states and 1191 transitions. [2022-04-28 09:07:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:07:42,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 65 [2022-04-28 09:07:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:07:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:07:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2022-04-28 09:07:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:07:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2022-04-28 09:07:42,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 147 transitions. [2022-04-28 09:07:42,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:42,975 INFO L225 Difference]: With dead ends: 1028 [2022-04-28 09:07:42,975 INFO L226 Difference]: Without dead ends: 979 [2022-04-28 09:07:42,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:07:42,976 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 175 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:07:42,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 86 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:07:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-04-28 09:07:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 394. [2022-04-28 09:07:46,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:07:46,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 979 states. Second operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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-28 09:07:46,650 INFO L74 IsIncluded]: Start isIncluded. First operand 979 states. Second operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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-28 09:07:46,651 INFO L87 Difference]: Start difference. First operand 979 states. Second operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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-28 09:07:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:46,686 INFO L93 Difference]: Finished difference Result 979 states and 1135 transitions. [2022-04-28 09:07:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1135 transitions. [2022-04-28 09:07:46,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:46,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:46,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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 979 states. [2022-04-28 09:07:46,688 INFO L87 Difference]: Start difference. First operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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 979 states. [2022-04-28 09:07:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:07:46,715 INFO L93 Difference]: Finished difference Result 979 states and 1135 transitions. [2022-04-28 09:07:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1135 transitions. [2022-04-28 09:07:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:07:46,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:07:46,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:07:46,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:07:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.1568123393316196) internal successors, (450), 389 states have internal predecessors, (450), 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-28 09:07:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 454 transitions. [2022-04-28 09:07:46,723 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 454 transitions. Word has length 65 [2022-04-28 09:07:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:07:46,723 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 454 transitions. [2022-04-28 09:07:46,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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-28 09:07:46,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 394 states and 454 transitions. [2022-04-28 09:07:48,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 454 transitions. [2022-04-28 09:07:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 09:07:48,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:07:48,730 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 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] [2022-04-28 09:07:48,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 09:07:48,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 09:07:48,930 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:07:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:07:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2072084830, now seen corresponding path program 15 times [2022-04-28 09:07:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481423] [2022-04-28 09:07:48,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:07:48,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:07:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2072084830, now seen corresponding path program 16 times [2022-04-28 09:07:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:07:48,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299005062] [2022-04-28 09:07:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:07:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:07:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:07:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:49,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {55367#(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); {55355#true} is VALID [2022-04-28 09:07:49,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-28 09:07:49,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {55355#true} call ULTIMATE.init(); {55367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {55367#(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); {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {55355#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; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:49,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {55355#true} assume !(~i~0 % 4294967296 < 5); {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {55355#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {55355#true} is VALID [2022-04-28 09:07:49,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {55355#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {55360#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:49,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {55360#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55360#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:07:49,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {55360#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {55361#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:49,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {55361#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55361#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:07:49,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {55361#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {55362#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:49,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {55362#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55362#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:49,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {55362#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {55363#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:49,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {55363#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55363#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:07:49,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {55363#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:07:49,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:07:49,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !(0 != #t~mem4);havoc #t~mem4; {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:07:49,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {55364#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} ~cont~0 := 0;~i~0 := 0; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~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; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {55365#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 4 main_~n_caracter~0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {55366#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {55366#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {55356#false} ~i~0 := 0;~cont_aux~0 := 0; {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {55356#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {55356#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {55356#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {55356#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; {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {55356#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55356#false} is VALID [2022-04-28 09:07:49,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {55356#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {55356#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {55356#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {55356#false} assume !(~j~0 % 4294967296 < 2); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {55356#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {55356#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {55356#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {55356#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {55356#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; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {55356#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {55356#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {55356#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {55356#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {55356#false} assume !(~j~0 % 4294967296 < 2); {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {55356#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55356#false} is VALID [2022-04-28 09:07:49,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {55356#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {55356#false} assume !(0 != #t~mem11);havoc #t~mem11; {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L272 TraceCheckUtils]: 63: Hoare triple {55356#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-28 09:07:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:07:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:07:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299005062] [2022-04-28 09:07:49,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299005062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:07:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533947214] [2022-04-28 09:07:49,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:07:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:07:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:07:49,097 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:07:49,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 09:07:49,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:07:49,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:07:49,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:07:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:07:49,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:07:49,661 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-28 09:07:49,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {55355#true} call ULTIMATE.init(); {55355#true} is VALID [2022-04-28 09:07:49,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {55355#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); {55355#true} is VALID [2022-04-28 09:07:49,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-28 09:07:49,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-28 09:07:49,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-28 09:07:49,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {55355#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; {55386#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {55386#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55386#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {55386#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55393#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {55393#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55393#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {55393#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {55400#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {55400#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {55400#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {55400#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:07:49,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {55400#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {55428#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {55428#(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 + ~n_caracter~0 % 4294967296, 1); {55428#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {55428#(and (= main_~n_caracter~0 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; {55435#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {55435#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55435#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {55435#(and (= main_~n_caracter~0 1) (= |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; {55442#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:07:49,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {55442#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55446#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:07:49,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {55446#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {55450#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:07:49,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {55499#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~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; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:07:49,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {55530#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55561#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:07:49,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {55561#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55565#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:49,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {55565#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {55356#false} is VALID [2022-04-28 09:07:49,713 INFO L272 TraceCheckUtils]: 63: Hoare triple {55356#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {55356#false} is VALID [2022-04-28 09:07:49,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-28 09:07:49,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-28 09:07:49,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-28 09:07:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-28 09:07:49,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:07:49,918 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:07:49,918 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 22 treesize of output 13 [2022-04-28 09:07:50,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-28 09:07:50,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-28 09:07:50,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-28 09:07:50,009 INFO L272 TraceCheckUtils]: 63: Hoare triple {55356#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {55356#false} is VALID [2022-04-28 09:07:50,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {55565#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {55356#false} is VALID [2022-04-28 09:07:50,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {55596#(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 + ~i~0 % 4294967296, 1); {55565#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:07:50,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55596#(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-28 09:07:50,011 INFO L290 TraceCheckUtils]: 59: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,012 INFO L290 TraceCheckUtils]: 56: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {55600#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:07:50,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {55631#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {55711#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {55662#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:07:50,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {55715#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55711#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:07:50,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {55719#(= 2 (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; {55715#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:07:50,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {55719#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55719#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:07:50,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {55726#(= 2 (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; {55719#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:07:50,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {55726#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {55726#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:07:50,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {55355#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {55726#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:07:50,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {55355#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {55355#true} is VALID [2022-04-28 09:07:50,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {55355#true} assume !(~i~0 % 4294967296 < 5); {55355#true} is VALID [2022-04-28 09:07:50,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:50,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:50,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:50,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {55355#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {55355#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {55355#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; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-28 09:07:50,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-28 09:07:50,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {55355#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); {55355#true} is VALID [2022-04-28 09:07:50,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {55355#true} call ULTIMATE.init(); {55355#true} is VALID [2022-04-28 09:07:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-28 09:07:50,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533947214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:07:50,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:07:50,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 30 [2022-04-28 09:07:50,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:07:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481423] [2022-04-28 09:07:50,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:07:50,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:07:50,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:07:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842378699] [2022-04-28 09:07:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:07:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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 67 [2022-04-28 09:07:50,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:07:50,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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-28 09:07:50,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:07:50,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:07:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:07:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:07:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:07:50,072 INFO L87 Difference]: Start difference. First operand 394 states and 454 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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-28 09:08:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:04,131 INFO L93 Difference]: Finished difference Result 1296 states and 1503 transitions. [2022-04-28 09:08:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:08:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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 67 [2022-04-28 09:08:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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-28 09:08:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-04-28 09:08:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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-28 09:08:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-04-28 09:08:04,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 170 transitions. [2022-04-28 09:08:04,258 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-28 09:08:04,316 INFO L225 Difference]: With dead ends: 1296 [2022-04-28 09:08:04,317 INFO L226 Difference]: Without dead ends: 1247 [2022-04-28 09:08:04,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 09:08:04,318 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 198 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:04,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 110 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:08:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-04-28 09:08:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 396. [2022-04-28 09:08:08,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:08,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1247 states. Second operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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-28 09:08:08,196 INFO L74 IsIncluded]: Start isIncluded. First operand 1247 states. Second operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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-28 09:08:08,196 INFO L87 Difference]: Start difference. First operand 1247 states. Second operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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-28 09:08:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:08,249 INFO L93 Difference]: Finished difference Result 1247 states and 1447 transitions. [2022-04-28 09:08:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1447 transitions. [2022-04-28 09:08:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:08,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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 1247 states. [2022-04-28 09:08:08,251 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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 1247 states. [2022-04-28 09:08:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:08,292 INFO L93 Difference]: Finished difference Result 1247 states and 1447 transitions. [2022-04-28 09:08:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1447 transitions. [2022-04-28 09:08:08,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:08,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:08,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:08,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.1585677749360614) internal successors, (453), 391 states have internal predecessors, (453), 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-28 09:08:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 457 transitions. [2022-04-28 09:08:08,308 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 457 transitions. Word has length 67 [2022-04-28 09:08:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:08,308 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 457 transitions. [2022-04-28 09:08:08,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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-28 09:08:08,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 457 transitions. [2022-04-28 09:08:10,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 457 transitions. [2022-04-28 09:08:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 09:08:10,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:10,576 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 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] [2022-04-28 09:08:10,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 09:08:10,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:10,777 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1998884903, now seen corresponding path program 17 times [2022-04-28 09:08:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:10,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936765161] [2022-04-28 09:08:10,781 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:10,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1998884903, now seen corresponding path program 18 times [2022-04-28 09:08:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555073875] [2022-04-28 09:08:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:10,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:10,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {61696#(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); {61683#true} is VALID [2022-04-28 09:08:10,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-28 09:08:10,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-28 09:08:10,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {61683#true} call ULTIMATE.init(); {61696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:10,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {61696#(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); {61683#true} is VALID [2022-04-28 09:08:10,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-28 09:08:10,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {61683#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; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {61683#true} assume !(~i~0 % 4294967296 < 5); {61683#true} is VALID [2022-04-28 09:08:10,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {61683#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {61683#true} is VALID [2022-04-28 09:08:10,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {61683#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {61688#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:08:10,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {61688#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61688#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:08:10,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {61688#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {61689#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {61689#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61689#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {61689#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {61690#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:08:10,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {61690#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61690#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:08:10,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {61690#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {61691#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {61691#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61691#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {61691#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {61692#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:08:10,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {61692#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61692#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:08:10,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {61692#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:08:10,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:08:10,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} assume !(0 != #t~mem4);havoc #t~mem4; {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:08:10,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {61693#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} ~cont~0 := 0;~i~0 := 0; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} assume !(~j~0 % 4294967296 < 2); {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {61694#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 5 main_~n_caracter~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {61695#(and (<= (+ main_~i~0 4) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {61695#(and (<= (+ main_~i~0 4) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {61684#false} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {61684#false} ~i~0 := 0;~cont_aux~0 := 0; {61684#false} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {61684#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {61684#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61684#false} is VALID [2022-04-28 09:08:10,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {61684#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {61684#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; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {61684#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {61684#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {61684#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {61684#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {61684#false} assume !(~j~0 % 4294967296 < 2); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {61684#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {61684#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {61684#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {61684#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {61684#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; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {61684#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {61684#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 59: Hoare triple {61684#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61684#false} is VALID [2022-04-28 09:08:10,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {61684#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {61684#false} assume !(~j~0 % 4294967296 < 2); {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {61684#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {61684#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {61684#false} assume !(0 != #t~mem11);havoc #t~mem11; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L272 TraceCheckUtils]: 65: Hoare triple {61684#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-28 09:08:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:08:10,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:10,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555073875] [2022-04-28 09:08:10,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555073875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041825242] [2022-04-28 09:08:10,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:08:10,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:10,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:10,956 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:08:10,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 09:08:11,110 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:08:11,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:11,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:08:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:11,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:11,615 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-28 09:08:11,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {61683#true} call ULTIMATE.init(); {61683#true} is VALID [2022-04-28 09:08:11,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {61683#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); {61683#true} is VALID [2022-04-28 09:08:11,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-28 09:08:11,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-28 09:08:11,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-28 09:08:11,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {61683#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; {61715#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {61715#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61715#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {61715#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61722#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {61722#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61722#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {61722#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {61729#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {61729#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {61729#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {61729#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:11,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {61729#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {61757#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {61757#(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 + ~n_caracter~0 % 4294967296, 1); {61757#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {61757#(and (= main_~n_caracter~0 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; {61764#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {61764#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61764#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {61764#(and (= main_~n_caracter~0 1) (= |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; {61771#(and (= (+ (- 1) main_~n_caracter~0) 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {61771#(and (= (+ (- 1) main_~n_caracter~0) 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61775#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:08:11,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {61775#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {61779#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:11,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {61834#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,654 INFO L290 TraceCheckUtils]: 55: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~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; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:11,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {61865#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61896#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:11,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {61896#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61900#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:08:11,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {61900#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {61684#false} is VALID [2022-04-28 09:08:11,657 INFO L272 TraceCheckUtils]: 65: Hoare triple {61684#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {61684#false} is VALID [2022-04-28 09:08:11,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-28 09:08:11,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-28 09:08:11,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-28 09:08:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 09:08:11,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:08:11,877 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:08:11,878 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 22 treesize of output 13 [2022-04-28 09:08:11,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-28 09:08:11,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-28 09:08:11,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-28 09:08:11,968 INFO L272 TraceCheckUtils]: 65: Hoare triple {61684#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {61684#false} is VALID [2022-04-28 09:08:11,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {61900#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {61684#false} is VALID [2022-04-28 09:08:11,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {61931#(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 + ~i~0 % 4294967296, 1); {61900#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:08:11,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61931#(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-28 09:08:11,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {61935#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:11,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {61966#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {62052#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {61997#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:11,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {62056#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {62052#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:08:11,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {62060#(= 2 (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; {62056#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:08:11,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {62060#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {62060#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {62067#(= 2 (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; {62060#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {62067#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {62067#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {61683#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {62067#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {61683#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {61683#true} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {61683#true} assume !(~i~0 % 4294967296 < 5); {61683#true} is VALID [2022-04-28 09:08:11,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {61683#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {61683#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {61683#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; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-28 09:08:11,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {61683#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); {61683#true} is VALID [2022-04-28 09:08:11,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {61683#true} call ULTIMATE.init(); {61683#true} is VALID [2022-04-28 09:08:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-28 09:08:11,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041825242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:11,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 31 [2022-04-28 09:08:11,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:11,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936765161] [2022-04-28 09:08:11,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936765161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:11,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:11,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:08:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717619078] [2022-04-28 09:08:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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 69 [2022-04-28 09:08:11,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:11,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-28 09:08:12,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:12,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:08:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:08:12,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:08:12,018 INFO L87 Difference]: Start difference. First operand 396 states and 457 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-28 09:08:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:30,489 INFO L93 Difference]: Finished difference Result 1564 states and 1815 transitions. [2022-04-28 09:08:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:08:30,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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 69 [2022-04-28 09:08:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:08:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-28 09:08:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2022-04-28 09:08:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-28 09:08:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2022-04-28 09:08:30,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 193 transitions. [2022-04-28 09:08:30,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:30,726 INFO L225 Difference]: With dead ends: 1564 [2022-04-28 09:08:30,727 INFO L226 Difference]: Without dead ends: 1515 [2022-04-28 09:08:30,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:08:30,728 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 228 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:08:30,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 134 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:08:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-28 09:08:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 398. [2022-04-28 09:08:34,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:08:34,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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-28 09:08:34,917 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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-28 09:08:34,917 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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-28 09:08:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:34,971 INFO L93 Difference]: Finished difference Result 1515 states and 1759 transitions. [2022-04-28 09:08:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2022-04-28 09:08:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:34,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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 1515 states. [2022-04-28 09:08:34,973 INFO L87 Difference]: Start difference. First operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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 1515 states. [2022-04-28 09:08:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:08:35,033 INFO L93 Difference]: Finished difference Result 1515 states and 1759 transitions. [2022-04-28 09:08:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2022-04-28 09:08:35,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:08:35,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:08:35,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:08:35,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:08:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 393 states have (on average 1.1603053435114503) internal successors, (456), 393 states have internal predecessors, (456), 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-28 09:08:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2022-04-28 09:08:35,042 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 69 [2022-04-28 09:08:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:08:35,042 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2022-04-28 09:08:35,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-28 09:08:35,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 460 transitions. [2022-04-28 09:08:37,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2022-04-28 09:08:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 09:08:37,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:08:37,270 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 4, 4, 3, 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] [2022-04-28 09:08:37,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 09:08:37,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:37,483 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:08:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:08:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1485591660, now seen corresponding path program 19 times [2022-04-28 09:08:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165057931] [2022-04-28 09:08:37,487 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:08:37,488 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:08:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1485591660, now seen corresponding path program 20 times [2022-04-28 09:08:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:08:37,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881993975] [2022-04-28 09:08:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:08:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:08:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:08:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {69116#(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); {69102#true} is VALID [2022-04-28 09:08:37,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-28 09:08:37,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-28 09:08:37,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {69102#true} call ULTIMATE.init(); {69116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:08:37,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {69116#(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); {69102#true} is VALID [2022-04-28 09:08:37,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-28 09:08:37,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {69102#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; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {69102#true} assume !(~i~0 % 4294967296 < 5); {69102#true} is VALID [2022-04-28 09:08:37,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {69102#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {69102#true} is VALID [2022-04-28 09:08:37,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {69102#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {69107#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:08:37,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {69107#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69107#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:08:37,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {69107#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69108#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:08:37,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {69108#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69108#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:08:37,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {69108#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69109#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:08:37,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {69109#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69109#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:08:37,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {69109#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69110#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:08:37,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {69110#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69110#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:08:37,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {69110#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69111#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:08:37,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {69111#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69111#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:08:37,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {69111#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69112#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:08:37,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {69112#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69112#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:08:37,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {69112#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:08:37,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:08:37,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} assume !(0 != #t~mem4);havoc #t~mem4; {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:08:37,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {69113#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} ~cont~0 := 0;~i~0 := 0; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~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; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:37,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {69114#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 6 main_~n_caracter~0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {69115#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ 5 main_~i~0) main_~n_caracter~0))} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {69115#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ 5 main_~i~0) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {69103#false} ~i~0 := 0;~cont_aux~0 := 0; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {69103#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {69103#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {69103#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {69103#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; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {69103#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {69103#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {69103#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {69103#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {69103#false} assume !(~j~0 % 4294967296 < 2); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {69103#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {69103#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {69103#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {69103#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {69103#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; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {69103#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {69103#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {69103#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {69103#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {69103#false} assume !(~j~0 % 4294967296 < 2); {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {69103#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {69103#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {69103#false} assume !(0 != #t~mem11);havoc #t~mem11; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L272 TraceCheckUtils]: 67: Hoare triple {69103#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-28 09:08:37,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-28 09:08:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:08:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:08:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881993975] [2022-04-28 09:08:37,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881993975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:08:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337212224] [2022-04-28 09:08:37,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:08:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:08:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:08:37,695 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:08:37,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 09:08:37,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:08:37,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:08:37,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:08:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:08:37,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:08:38,294 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-28 09:08:38,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {69102#true} call ULTIMATE.init(); {69102#true} is VALID [2022-04-28 09:08:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {69102#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); {69102#true} is VALID [2022-04-28 09:08:38,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-28 09:08:38,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-28 09:08:38,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-28 09:08:38,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {69102#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; {69135#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {69135#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69135#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {69135#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69142#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {69142#(and (= main_~i~0 1) (= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69142#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {69142#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {69149#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {69149#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {69149#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {69149#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:08:38,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {69149#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {69177#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {69177#(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 + ~n_caracter~0 % 4294967296, 1); {69177#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {69177#(and (= main_~n_caracter~0 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; {69184#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {69184#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69184#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {69184#(and (= (+ (- 1) main_~n_caracter~0) 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; {69191#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:08:38,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {69191#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69195#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:08:38,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {69195#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {69199#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:08:38,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {69260#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~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; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:08:38,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {69291#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69322#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:08:38,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {69322#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69326#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:08:38,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {69326#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {69103#false} is VALID [2022-04-28 09:08:38,336 INFO L272 TraceCheckUtils]: 67: Hoare triple {69103#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {69103#false} is VALID [2022-04-28 09:08:38,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-28 09:08:38,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-28 09:08:38,336 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-28 09:08:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 09:08:38,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:08:38,579 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:08:38,580 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 22 treesize of output 13 [2022-04-28 09:08:38,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-28 09:08:38,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-28 09:08:38,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-28 09:08:38,685 INFO L272 TraceCheckUtils]: 67: Hoare triple {69103#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {69103#false} is VALID [2022-04-28 09:08:38,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {69326#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {69103#false} is VALID [2022-04-28 09:08:38,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {69357#(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 + ~i~0 % 4294967296, 1); {69326#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:08:38,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69357#(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-28 09:08:38,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,690 INFO L290 TraceCheckUtils]: 57: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,690 INFO L290 TraceCheckUtils]: 56: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {69361#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:08:38,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {69392#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {69484#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {69423#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:08:38,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {69488#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69484#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:08:38,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {69492#(= 2 (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; {69488#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:08:38,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {69492#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69492#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:08:38,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {69499#(= 2 (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; {69492#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {69499#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {69499#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {69102#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {69499#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {69102#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {69102#true} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {69102#true} assume !(~i~0 % 4294967296 < 5); {69102#true} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:38,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {69102#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {69102#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {69102#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; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {69102#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); {69102#true} is VALID [2022-04-28 09:08:38,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {69102#true} call ULTIMATE.init(); {69102#true} is VALID [2022-04-28 09:08:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-04-28 09:08:38,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337212224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:08:38,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:08:38,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 32 [2022-04-28 09:08:38,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:08:38,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165057931] [2022-04-28 09:08:38,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165057931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:08:38,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:08:38,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:08:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203087082] [2022-04-28 09:08:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:08:38,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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 71 [2022-04-28 09:08:38,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:08:38,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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-28 09:08:38,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:08:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:08:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:08:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:08:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:08:38,741 INFO L87 Difference]: Start difference. First operand 398 states and 460 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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-28 09:09:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:02,895 INFO L93 Difference]: Finished difference Result 1832 states and 2127 transitions. [2022-04-28 09:09:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:09:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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 71 [2022-04-28 09:09:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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-28 09:09:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2022-04-28 09:09:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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-28 09:09:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2022-04-28 09:09:02,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 216 transitions. [2022-04-28 09:09:03,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:03,249 INFO L225 Difference]: With dead ends: 1832 [2022-04-28 09:09:03,249 INFO L226 Difference]: Without dead ends: 1783 [2022-04-28 09:09:03,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1572, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:09:03,251 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 269 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:03,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 146 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 09:09:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-04-28 09:09:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 400. [2022-04-28 09:09:07,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:09:07,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1783 states. Second operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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-28 09:09:07,750 INFO L74 IsIncluded]: Start isIncluded. First operand 1783 states. Second operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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-28 09:09:07,750 INFO L87 Difference]: Start difference. First operand 1783 states. Second operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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-28 09:09:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:07,849 INFO L93 Difference]: Finished difference Result 1783 states and 2071 transitions. [2022-04-28 09:09:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2071 transitions. [2022-04-28 09:09:07,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:07,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:07,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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 1783 states. [2022-04-28 09:09:07,851 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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 1783 states. [2022-04-28 09:09:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:07,934 INFO L93 Difference]: Finished difference Result 1783 states and 2071 transitions. [2022-04-28 09:09:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2071 transitions. [2022-04-28 09:09:07,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:07,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:07,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:09:07,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:09:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.1620253164556962) internal successors, (459), 395 states have internal predecessors, (459), 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-28 09:09:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 463 transitions. [2022-04-28 09:09:07,944 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 463 transitions. Word has length 71 [2022-04-28 09:09:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:09:07,944 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 463 transitions. [2022-04-28 09:09:07,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 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-28 09:09:07,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 463 transitions. [2022-04-28 09:09:10,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 463 transitions. [2022-04-28 09:09:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 09:09:10,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:09:10,537 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 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] [2022-04-28 09:09:10,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 09:09:10,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-28 09:09:10,738 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:09:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:09:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 930201970, now seen corresponding path program 21 times [2022-04-28 09:09:10,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:10,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131031536] [2022-04-28 09:09:10,742 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:09:10,742 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:09:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 930201970, now seen corresponding path program 22 times [2022-04-28 09:09:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:09:10,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950690997] [2022-04-28 09:09:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:09:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:09:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:09:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:11,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {77628#(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); {77612#true} is VALID [2022-04-28 09:09:11,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-28 09:09:11,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-28 09:09:11,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {77612#true} call ULTIMATE.init(); {77628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:09:11,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {77628#(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); {77612#true} is VALID [2022-04-28 09:09:11,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-28 09:09:11,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-28 09:09:11,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-28 09:09:11,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {77612#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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {77617#(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); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {77617#(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 + ~n_caracter~0 % 4294967296, 1); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {77617#(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 + ~n_caracter~0 % 4294967296, 1); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {77617#(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 + ~n_caracter~0 % 4294967296, 1); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {77618#(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; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {77619#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (or (and (<= main_~i~0 1) (<= main_~n_caracter~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) main_~i~0 4294967294)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)))} is VALID [2022-04-28 09:09:11,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {77619#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (or (and (<= main_~i~0 1) (<= main_~n_caracter~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) main_~i~0 4294967294)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {77620#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (* 4294967296 (div main_~j~0 4294967296))) (= |main_~#input_string~0.offset| 0) (= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:09:11,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {77620#(and (= |main_~#vogal_array~0.offset| 0) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (* 4294967296 (div main_~j~0 4294967296))) (= |main_~#input_string~0.offset| 0) (= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77621#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {77621#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {77622#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= |main_~#input_string~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {77622#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= |main_~#input_string~0.offset| 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(~j~0 % 4294967296 < 2); {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:11,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:11,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {77623#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77626#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {77626#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77627#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {77627#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {77613#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {77613#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:11,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {77613#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {77613#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L272 TraceCheckUtils]: 68: Hoare triple {77613#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-28 09:09:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 09:09:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:09:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950690997] [2022-04-28 09:09:11,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950690997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:09:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817932712] [2022-04-28 09:09:11,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:09:11,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:11,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:09:11,421 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:09:11,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 09:09:11,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:09:11,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:09:11,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 09:09:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:11,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:09:12,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:09:12,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-04-28 09:09:12,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {77612#true} call ULTIMATE.init(); {77612#true} is VALID [2022-04-28 09:09:12,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {77612#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); {77612#true} is VALID [2022-04-28 09:09:12,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-28 09:09:12,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-28 09:09:12,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-28 09:09:12,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {77612#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; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {77618#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {77617#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {77617#(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); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {77686#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {77686#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {77686#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {77686#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {77617#(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 + ~n_caracter~0 % 4294967296, 1); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {77617#(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; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {77617#(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 + ~n_caracter~0 % 4294967296, 1); {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {77617#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {77618#(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; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {77618#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {77735#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:12,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {77735#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {77739#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:12,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {77739#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77743#(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| 1)) |main_#t~mem8|))} is VALID [2022-04-28 09:09:12,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {77743#(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| 1)) |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; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:12,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {77624#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,116 INFO L290 TraceCheckUtils]: 46: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:12,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {77625#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77801#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:12,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {77801#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77801#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:12,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {77801#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77808#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:12,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {77808#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77812#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 59: Hoare triple {77812#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 60: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {77613#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {77613#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {77613#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {77613#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-28 09:09:12,123 INFO L272 TraceCheckUtils]: 68: Hoare triple {77613#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {77613#false} is VALID [2022-04-28 09:09:12,124 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-28 09:09:12,124 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-28 09:09:12,124 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-28 09:09:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 09:09:12,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:09:12,356 INFO L356 Elim1Store]: treesize reduction 29, result has 68.1 percent of original size [2022-04-28 09:09:12,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 69 [2022-04-28 09:09:12,565 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-28 09:09:12,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-28 09:09:12,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-28 09:09:12,565 INFO L272 TraceCheckUtils]: 68: Hoare triple {77613#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {77613#false} is VALID [2022-04-28 09:09:12,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-28 09:09:12,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {77613#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {77613#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {77613#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {77613#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {77613#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77613#false} is VALID [2022-04-28 09:09:12,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {77812#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77613#false} is VALID [2022-04-28 09:09:12,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {77891#(= (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|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77812#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:09:12,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {77895#(= (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|))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77891#(= (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|)))} is VALID [2022-04-28 09:09:12,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {77895#(= (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|))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77895#(= (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|))} is VALID [2022-04-28 09:09:12,568 INFO L290 TraceCheckUtils]: 55: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {77895#(= (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|))} is VALID [2022-04-28 09:09:12,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !(~j~0 % 4294967296 < 2); {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} 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; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {77902#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~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); {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !(~j~0 % 4294967296 < 2); {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {77958#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {77933#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))} is VALID [2022-04-28 09:09:12,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {77962#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77958#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:09:12,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {77966#(= (mod main_~i~0 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {77962#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:09:12,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {77966#(= (mod main_~i~0 4294967296) 1)} is VALID [2022-04-28 09:09:12,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(~j~0 % 4294967296 < 2); {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {77970#(= (mod (+ main_~i~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; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {77612#true} ~cont~0 := 0;~i~0 := 0; {77970#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:12,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {77612#true} assume !(0 != #t~mem4);havoc #t~mem4; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {77612#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {77612#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {77612#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {77612#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {77612#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {77612#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {77612#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {77612#true} assume !(~i~0 % 4294967296 < 5); {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {77612#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {77612#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {77612#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {77612#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {77612#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {77612#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77612#true} is VALID [2022-04-28 09:09:12,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {77612#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {77612#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {77612#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {77612#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {77612#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; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {77612#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); {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {77612#true} call ULTIMATE.init(); {77612#true} is VALID [2022-04-28 09:09:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 09:09:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817932712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:09:12,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:09:12,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 29 [2022-04-28 09:09:12,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:09:12,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131031536] [2022-04-28 09:09:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131031536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:09:12,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:09:12,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:09:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507394644] [2022-04-28 09:09:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:09:12,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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 72 [2022-04-28 09:09:12,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:09:12,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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-28 09:09:12,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:09:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:09:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-04-28 09:09:12,622 INFO L87 Difference]: Start difference. First operand 400 states and 463 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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-28 09:09:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:22,376 INFO L93 Difference]: Finished difference Result 770 states and 892 transitions. [2022-04-28 09:09:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:09:22,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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 72 [2022-04-28 09:09:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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-28 09:09:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-04-28 09:09:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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-28 09:09:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-04-28 09:09:22,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 134 transitions. [2022-04-28 09:09:22,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:22,524 INFO L225 Difference]: With dead ends: 770 [2022-04-28 09:09:22,524 INFO L226 Difference]: Without dead ends: 716 [2022-04-28 09:09:22,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:09:22,525 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 198 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:22,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 59 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:09:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-04-28 09:09:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 569. [2022-04-28 09:09:29,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:09:29,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 716 states. Second operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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-28 09:09:29,147 INFO L74 IsIncluded]: Start isIncluded. First operand 716 states. Second operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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-28 09:09:29,147 INFO L87 Difference]: Start difference. First operand 716 states. Second operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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-28 09:09:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:29,161 INFO L93 Difference]: Finished difference Result 716 states and 825 transitions. [2022-04-28 09:09:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 825 transitions. [2022-04-28 09:09:29,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:29,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:29,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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 716 states. [2022-04-28 09:09:29,162 INFO L87 Difference]: Start difference. First operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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 716 states. [2022-04-28 09:09:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:29,175 INFO L93 Difference]: Finished difference Result 716 states and 825 transitions. [2022-04-28 09:09:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 825 transitions. [2022-04-28 09:09:29,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:09:29,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:09:29,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:09:29,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:09:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 564 states have (on average 1.1613475177304964) internal successors, (655), 564 states have internal predecessors, (655), 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-28 09:09:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 659 transitions. [2022-04-28 09:09:29,189 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 659 transitions. Word has length 72 [2022-04-28 09:09:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:09:29,189 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 659 transitions. [2022-04-28 09:09:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 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-28 09:09:29,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 569 states and 659 transitions. [2022-04-28 09:09:32,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 659 transitions. [2022-04-28 09:09:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 09:09:32,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:09:32,317 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 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] [2022-04-28 09:09:32,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 09:09:32,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:32,534 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:09:32,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:09:32,534 INFO L85 PathProgramCache]: Analyzing trace with hash -188563146, now seen corresponding path program 23 times [2022-04-28 09:09:32,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:32,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019810677] [2022-04-28 09:09:32,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:09:32,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:09:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -188563146, now seen corresponding path program 24 times [2022-04-28 09:09:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:09:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187096549] [2022-04-28 09:09:32,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:09:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:09:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:09:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:33,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {82228#(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); {82207#true} is VALID [2022-04-28 09:09:33,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-28 09:09:33,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-28 09:09:33,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {82207#true} call ULTIMATE.init(); {82228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:09:33,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {82228#(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); {82207#true} is VALID [2022-04-28 09:09:33,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-28 09:09:33,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-28 09:09:33,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-28 09:09:33,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {82207#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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {82212#(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); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {82213#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {82213#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82213#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {82213#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {82214#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:09:33,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {82214#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82214#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:09:33,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {82214#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} assume !(0 != #t~mem4);havoc #t~mem4; {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {82215#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} ~cont~0 := 0;~i~0 := 0; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(~j~0 % 4294967296 < 2); {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:09:33,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {82216#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82217#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= (div main_~i~0 4294967296) 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {82217#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= (div main_~i~0 4294967296) 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {82218#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82219#(and (= |main_~#vogal_array~0.offset| 0) (or (and (= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (not (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {82219#(and (= |main_~#vogal_array~0.offset| 0) (or (and (= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (not (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82220#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))} is VALID [2022-04-28 09:09:33,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {82220#(and (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 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; {82221#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))} is VALID [2022-04-28 09:09:33,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {82221#(and (= |main_~#vogal_array~0.offset| 0) (= (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|))) (= |main_~#input_string~0.offset| 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(~j~0 % 4294967296 < 2); {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:33,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:33,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {82222#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {82225#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82226#(and (= |main_~#vogal_array~0.offset| 0) (or (and (= (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|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)) (not (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|)))) (= |main_~#input_string~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} is VALID [2022-04-28 09:09:33,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {82226#(and (= |main_~#vogal_array~0.offset| 0) (or (and (= (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|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)) (not (= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) (+ main_~j~0 |main_~#vogal_array~0.offset|)))) (= |main_~#input_string~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82227#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:09:33,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {82227#(and (= |main_~#input_string~0.offset| 0) (= |main_#t~mem14| |main_#t~mem13|) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82208#false} is VALID [2022-04-28 09:09:33,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {82208#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {82208#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {82208#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L272 TraceCheckUtils]: 68: Hoare triple {82208#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-28 09:09:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:09:33,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:09:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187096549] [2022-04-28 09:09:33,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187096549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:09:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524318429] [2022-04-28 09:09:33,333 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:09:33,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:09:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:09:33,334 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:09:33,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 09:09:33,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 09:09:33,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:09:33,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 09:09:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:09:33,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:09:34,106 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-28 09:09:34,106 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-28 09:09:34,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {82207#true} call ULTIMATE.init(); {82207#true} is VALID [2022-04-28 09:09:34,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {82207#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); {82207#true} is VALID [2022-04-28 09:09:34,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-28 09:09:34,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-28 09:09:34,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-28 09:09:34,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {82207#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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {82212#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {82212#(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); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {82212#(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 + ~n_caracter~0 % 4294967296, 1); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {82212#(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 + ~n_caracter~0 % 4294967296, 1); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {82212#(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; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {82212#(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 + ~n_caracter~0 % 4294967296, 1); {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {82212#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {82307#(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; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {82307#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82335#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:34,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {82335#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:34,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:34,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:34,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {82339#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82349#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:09:34,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {82349#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82353#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:09:34,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {82353#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {82223#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:09:34,149 INFO L290 TraceCheckUtils]: 55: Hoare triple {82224#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82402#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {82402#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82402#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {82402#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,150 INFO L290 TraceCheckUtils]: 58: Hoare triple {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {82409#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82419#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= (+ (- 1) main_~j~0) 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:09:34,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {82419#(and (= |main_~#vogal_array~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1)) (= (+ (- 1) main_~j~0) 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82423#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 62: Hoare triple {82423#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 63: Hoare triple {82208#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 65: Hoare triple {82208#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 66: Hoare triple {82208#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L272 TraceCheckUtils]: 68: Hoare triple {82208#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-28 09:09:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:09:34,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:09:34,411 INFO L356 Elim1Store]: treesize reduction 35, result has 63.9 percent of original size [2022-04-28 09:09:34,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 69 [2022-04-28 09:09:34,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L272 TraceCheckUtils]: 68: Hoare triple {82208#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {82208#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {82208#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {82208#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82208#false} is VALID [2022-04-28 09:09:34,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {82423#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82208#false} is VALID [2022-04-28 09:09:34,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {82484#(= (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|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82423#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2022-04-28 09:09:34,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82484#(= (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|)))} is VALID [2022-04-28 09:09:34,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:09:34,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:09:34,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {82498#(= (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| 1)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82488#(= (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 1) 4294967296) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:09:34,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {82498#(= (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| 1)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82498#(= (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| 1)))} is VALID [2022-04-28 09:09:34,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {82498#(= (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| 1)))} is VALID [2022-04-28 09:09:34,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} assume !(~j~0 % 4294967296 < 2); {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 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; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} ~i~0 := 0;~cont_aux~0 := 0; {82505#(= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))))} is VALID [2022-04-28 09:09:34,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} is VALID [2022-04-28 09:09:34,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} is VALID [2022-04-28 09:09:34,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} assume !(~j~0 % 4294967296 < 2); {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} is VALID [2022-04-28 09:09:34,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} is VALID [2022-04-28 09:09:34,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {82552#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {82536#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))} is VALID [2022-04-28 09:09:34,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {82556#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82552#(or (not (= |main_#t~mem9| |main_#t~mem8|)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:09:34,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82556#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:09:34,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:09:34,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:09:34,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {82570#(= (mod main_~i~0 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {82560#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:09:34,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {82570#(= (mod main_~i~0 4294967296) 1)} is VALID [2022-04-28 09:09:34,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(~j~0 % 4294967296 < 2); {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {82574#(= (mod (+ main_~i~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; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {82207#true} ~cont~0 := 0;~i~0 := 0; {82574#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {82207#true} assume !(0 != #t~mem4);havoc #t~mem4; {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {82207#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {82207#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {82207#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {82207#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {82207#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {82207#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {82207#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {82207#true} assume !(~i~0 % 4294967296 < 5); {82207#true} is VALID [2022-04-28 09:09:34,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {82207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {82207#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {82207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {82207#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {82207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {82207#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {82207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {82207#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {82207#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {82207#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {82207#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; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {82207#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); {82207#true} is VALID [2022-04-28 09:09:34,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {82207#true} call ULTIMATE.init(); {82207#true} is VALID [2022-04-28 09:09:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:09:34,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524318429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:09:34,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:09:34,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 38 [2022-04-28 09:09:34,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:09:34,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019810677] [2022-04-28 09:09:34,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019810677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:09:34,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:09:34,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 09:09:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865412575] [2022-04-28 09:09:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:09:34,689 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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 72 [2022-04-28 09:09:34,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:09:34,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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-28 09:09:34,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:34,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 09:09:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:09:34,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 09:09:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 09:09:34,737 INFO L87 Difference]: Start difference. First operand 569 states and 659 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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-28 09:09:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:09:51,764 INFO L93 Difference]: Finished difference Result 1224 states and 1411 transitions. [2022-04-28 09:09:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 09:09:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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 72 [2022-04-28 09:09:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:09:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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-28 09:09:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 153 transitions. [2022-04-28 09:09:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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-28 09:09:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 153 transitions. [2022-04-28 09:09:51,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 153 transitions. [2022-04-28 09:09:51,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:09:51,949 INFO L225 Difference]: With dead ends: 1224 [2022-04-28 09:09:51,949 INFO L226 Difference]: Without dead ends: 1161 [2022-04-28 09:09:51,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=2829, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:09:51,950 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 172 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:09:51,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 87 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 09:09:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-04-28 09:10:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 726. [2022-04-28 09:10:00,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:10:00,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1161 states. Second operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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-28 09:10:00,759 INFO L74 IsIncluded]: Start isIncluded. First operand 1161 states. Second operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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-28 09:10:00,760 INFO L87 Difference]: Start difference. First operand 1161 states. Second operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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-28 09:10:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:00,793 INFO L93 Difference]: Finished difference Result 1161 states and 1332 transitions. [2022-04-28 09:10:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1332 transitions. [2022-04-28 09:10:00,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:10:00,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:10:00,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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 1161 states. [2022-04-28 09:10:00,795 INFO L87 Difference]: Start difference. First operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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 1161 states. [2022-04-28 09:10:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:00,828 INFO L93 Difference]: Finished difference Result 1161 states and 1332 transitions. [2022-04-28 09:10:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1332 transitions. [2022-04-28 09:10:00,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:10:00,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:10:00,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:10:00,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:10:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 721 states have (on average 1.159500693481276) internal successors, (836), 721 states have internal predecessors, (836), 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-28 09:10:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 840 transitions. [2022-04-28 09:10:00,848 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 840 transitions. Word has length 72 [2022-04-28 09:10:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:10:00,848 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 840 transitions. [2022-04-28 09:10:00,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 states have internal predecessors, (56), 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-28 09:10:00,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 726 states and 840 transitions. [2022-04-28 09:10:05,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 840 edges. 840 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 840 transitions. [2022-04-28 09:10:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 09:10:05,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:10:05,237 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 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] [2022-04-28 09:10:05,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 09:10:05,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:10:05,437 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:10:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:10:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 673002482, now seen corresponding path program 25 times [2022-04-28 09:10:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:10:05,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576923950] [2022-04-28 09:10:05,442 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:10:05,442 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:10:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash 673002482, now seen corresponding path program 26 times [2022-04-28 09:10:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:10:05,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325394436] [2022-04-28 09:10:05,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:10:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:10:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:10:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:06,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {88956#(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); {88941#true} is VALID [2022-04-28 09:10:06,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-28 09:10:06,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-28 09:10:06,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {88941#true} call ULTIMATE.init(); {88956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:10:06,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {88956#(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); {88941#true} is VALID [2022-04-28 09:10:06,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-28 09:10:06,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-28 09:10:06,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-28 09:10:06,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {88941#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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {88946#(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); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {88947#(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; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {88948#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (or (and (<= main_~i~0 1) (<= main_~n_caracter~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) main_~i~0 4294967294)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)))} is VALID [2022-04-28 09:10:06,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {88948#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (or (and (<= main_~i~0 1) (<= main_~n_caracter~0 (+ (* 4294967296 (div main_~n_caracter~0 4294967296)) main_~i~0 4294967294)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {88949#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {88949#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88950#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {88950#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88951#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {88951#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !(~j~0 % 4294967296 < 2); {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} ~i~0 := 0;~cont_aux~0 := 0; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~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; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,096 INFO L290 TraceCheckUtils]: 57: Hoare triple {88952#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 0) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))) (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {88951#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:06,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {88951#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88955#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_#t~mem14| |main_#t~mem13|)) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:06,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {88955#(and (= |main_~#vogal_array~0.offset| 0) (not (= |main_#t~mem14| |main_#t~mem13|)) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} 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; {88942#false} is VALID [2022-04-28 09:10:06,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:06,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {88942#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:06,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {88942#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 63: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 65: Hoare triple {88942#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 66: Hoare triple {88942#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L272 TraceCheckUtils]: 68: Hoare triple {88942#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {88942#false} is VALID [2022-04-28 09:10:06,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-28 09:10:06,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-28 09:10:06,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-28 09:10:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 09:10:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:10:06,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325394436] [2022-04-28 09:10:06,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325394436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:10:06,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590065281] [2022-04-28 09:10:06,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:10:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:10:06,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:10:06,101 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:10:06,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 09:10:06,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:10:06,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:10:06,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 09:10:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:06,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:10:06,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:10:06,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-04-28 09:10:06,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {88941#true} call ULTIMATE.init(); {88941#true} is VALID [2022-04-28 09:10:06,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {88941#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); {88941#true} is VALID [2022-04-28 09:10:06,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-28 09:10:06,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-28 09:10:06,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-28 09:10:06,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {88941#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; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {88947#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {88946#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {88946#(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); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {88946#(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; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {88946#(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 + ~n_caracter~0 % 4294967296, 1); {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {88946#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {88947#(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; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {88947#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {89062#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {89062#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {89066#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:06,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {89066#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89070#(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| 1)) |main_#t~mem8|))} is VALID [2022-04-28 09:10:06,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {89070#(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| 1)) |main_#t~mem8|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} assume !(~j~0 % 4294967296 < 2); {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} is VALID [2022-04-28 09:10:06,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {88953#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))))} ~i~0 := 0;~cont_aux~0 := 0; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~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; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} is VALID [2022-04-28 09:10:06,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {88954#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {89128#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:06,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {89128#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {89128#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:06,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {89128#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {89135#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:06,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {89135#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 0))) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89139#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {89139#(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; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {88942#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {88942#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {88942#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {88942#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L272 TraceCheckUtils]: 68: Hoare triple {88942#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-28 09:10:06,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-28 09:10:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 09:10:06,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:10:07,022 INFO L356 Elim1Store]: treesize reduction 23, result has 74.7 percent of original size [2022-04-28 09:10:07,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 75 [2022-04-28 09:10:07,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-28 09:10:07,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-28 09:10:07,230 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-28 09:10:07,230 INFO L272 TraceCheckUtils]: 68: Hoare triple {88942#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {88942#false} is VALID [2022-04-28 09:10:07,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 66: Hoare triple {88942#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 65: Hoare triple {88942#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {88942#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {88942#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {88942#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {88942#false} is VALID [2022-04-28 09:10:07,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {89139#(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; {88942#false} is VALID [2022-04-28 09:10:07,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {89218#(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|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89139#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:10:07,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {89222#(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|)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {89218#(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|))))} is VALID [2022-04-28 09:10:07,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {89222#(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|)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {89222#(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|)))} is VALID [2022-04-28 09:10:07,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {89222#(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|)))} is VALID [2022-04-28 09:10:07,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} 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; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {89229#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~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); {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !(~j~0 % 4294967296 < 2); {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {89285#(or (= |main_#t~mem9| |main_#t~mem8|) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (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; {89260#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2022-04-28 09:10:07,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {89289#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89285#(or (= |main_#t~mem9| |main_#t~mem8|) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:10:07,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {89293#(= (mod main_~i~0 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {89289#(and (= (mod main_~j~0 4294967296) 0) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:10:07,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {89293#(= (mod main_~i~0 4294967296) 1)} is VALID [2022-04-28 09:10:07,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(~j~0 % 4294967296 < 2); {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {89297#(= (mod (+ main_~i~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; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {88941#true} ~cont~0 := 0;~i~0 := 0; {89297#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {88941#true} assume !(0 != #t~mem4);havoc #t~mem4; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {88941#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {88941#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {88941#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {88941#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {88941#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {88941#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {88941#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {88941#true} assume !(~i~0 % 4294967296 < 5); {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {88941#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {88941#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {88941#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {88941#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88941#true} is VALID [2022-04-28 09:10:07,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {88941#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {88941#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {88941#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {88941#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {88941#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {88941#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {88941#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; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {88941#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); {88941#true} is VALID [2022-04-28 09:10:07,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {88941#true} call ULTIMATE.init(); {88941#true} is VALID [2022-04-28 09:10:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 09:10:07,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590065281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:10:07,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:10:07,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 27 [2022-04-28 09:10:07,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:10:07,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576923950] [2022-04-28 09:10:07,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576923950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:10:07,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:10:07,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:10:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991175057] [2022-04-28 09:10:07,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:10:07,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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 72 [2022-04-28 09:10:07,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:10:07,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-28 09:10:07,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:07,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:10:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:10:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:10:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:10:07,287 INFO L87 Difference]: Start difference. First operand 726 states and 840 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-28 09:10:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:20,075 INFO L93 Difference]: Finished difference Result 952 states and 1094 transitions. [2022-04-28 09:10:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:10:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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 72 [2022-04-28 09:10:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:10:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-28 09:10:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 09:10:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-28 09:10:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 09:10:20,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-28 09:10:20,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:20,231 INFO L225 Difference]: With dead ends: 952 [2022-04-28 09:10:20,231 INFO L226 Difference]: Without dead ends: 908 [2022-04-28 09:10:20,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 09:10:20,232 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 171 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:10:20,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 63 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 09:10:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-04-28 09:10:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 760. [2022-04-28 09:10:29,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:10:29,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 908 states. Second operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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-28 09:10:29,645 INFO L74 IsIncluded]: Start isIncluded. First operand 908 states. Second operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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-28 09:10:29,645 INFO L87 Difference]: Start difference. First operand 908 states. Second operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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-28 09:10:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:29,666 INFO L93 Difference]: Finished difference Result 908 states and 1039 transitions. [2022-04-28 09:10:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1039 transitions. [2022-04-28 09:10:29,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:10:29,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:10:29,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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 908 states. [2022-04-28 09:10:29,668 INFO L87 Difference]: Start difference. First operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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 908 states. [2022-04-28 09:10:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:29,689 INFO L93 Difference]: Finished difference Result 908 states and 1039 transitions. [2022-04-28 09:10:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1039 transitions. [2022-04-28 09:10:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:10:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:10:29,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:10:29,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:10:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 755 states have (on average 1.1523178807947019) internal successors, (870), 755 states have internal predecessors, (870), 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-28 09:10:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 874 transitions. [2022-04-28 09:10:29,709 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 874 transitions. Word has length 72 [2022-04-28 09:10:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:10:29,709 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 874 transitions. [2022-04-28 09:10:29,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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-28 09:10:29,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 760 states and 874 transitions. [2022-04-28 09:10:34,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 874 edges. 874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 874 transitions. [2022-04-28 09:10:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 09:10:34,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:10:34,211 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 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] [2022-04-28 09:10:34,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 09:10:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 09:10:34,412 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:10:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:10:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 479223478, now seen corresponding path program 27 times [2022-04-28 09:10:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:10:34,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265287972] [2022-04-28 09:10:34,416 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:10:34,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:10:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 479223478, now seen corresponding path program 28 times [2022-04-28 09:10:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:10:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49665534] [2022-04-28 09:10:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:10:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:10:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:10:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:35,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {94685#(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); {94662#true} is VALID [2022-04-28 09:10:35,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-28 09:10:35,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-28 09:10:35,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {94662#true} call ULTIMATE.init(); {94685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:10:35,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {94685#(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); {94662#true} is VALID [2022-04-28 09:10:35,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-28 09:10:35,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-28 09:10:35,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-28 09:10:35,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {94662#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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {94667#(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); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:35,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {94669#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:10:35,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {94669#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94669#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:10:35,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {94669#(and (= |main_~#vogal_array~0.offset| 0) (<= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} assume !(0 != #t~mem4);havoc #t~mem4; {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {94670#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (<= (+ (div main_~n_caracter~0 4294967296) 1) 0)) (<= main_~n_caracter~0 2))} ~cont~0 := 0;~i~0 := 0; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} assume !(~j~0 % 4294967296 < 2); {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:10:35,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {94671#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (<= main_~n_caracter~0 2))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {94672#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= main_~i~0 1) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (not (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)))) (= |main_~#input_string~0.offset| 0) (or (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (<= main_~n_caracter~0 2)) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))} is VALID [2022-04-28 09:10:35,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {94672#(and (= |main_~#vogal_array~0.offset| 0) (or (and (<= main_~i~0 1) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|))) (not (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)))) (= |main_~#input_string~0.offset| 0) (or (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (<= main_~n_caracter~0 2)) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {94673#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (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; {94674#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {94674#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (< (* (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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94675#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {94675#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 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|))) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94676#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0) (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|)))) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)))} is VALID [2022-04-28 09:10:35,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {94676#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1) (= |main_~#input_string~0.offset| 0) (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|)))) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (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; {94677#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {94677#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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); {94677#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {94677#(and (= |main_~#vogal_array~0.offset| 0) (<= (div main_~i~0 4294967296) 0) (<= (+ main_~i~0 |main_~#input_string~0.offset|) (+ (* (div main_~i~0 4294967296) 4294967296) 1)) (= |main_~#input_string~0.offset| 0) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)) (< (* (div main_~i~0 4294967296) 4294967296) (+ main_~i~0 |main_~#input_string~0.offset|)) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {94678#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))} is VALID [2022-04-28 09:10:35,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {94678#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))) (< 0 (+ (div main_~n_caracter~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} ~i~0 := 0;~cont_aux~0 := 0; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} 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; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(~j~0 % 4294967296 < 2); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:35,326 INFO L290 TraceCheckUtils]: 55: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94681#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {94681#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94681#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {94681#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (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~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 1) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|)))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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-28 09:10:35,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {94682#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) 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~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94683#(and (= |main_~#vogal_array~0.offset| 0) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (and (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))) (= |main_~#input_string~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} is VALID [2022-04-28 09:10:35,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {94683#(and (= |main_~#vogal_array~0.offset| 0) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)) (and (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|)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))) (= |main_~#input_string~0.offset| 0) (or (and (<= (div main_~j~0 4294967296) 0) (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|))) (= (+ main_~j~0 |main_~#vogal_array~0.offset| (* (- 4294967296) (div main_~j~0 4294967296))) 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94684#(and (not (= |main_#t~mem14| |main_#t~mem13|)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {94684#(and (not (= |main_#t~mem14| |main_#t~mem13|)) (= |main_~#input_string~0.offset| 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 |main_~#input_string~0.offset|) 1))} 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; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {94663#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {94663#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {94663#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L272 TraceCheckUtils]: 68: Hoare triple {94663#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-28 09:10:35,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-28 09:10:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 09:10:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:10:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49665534] [2022-04-28 09:10:35,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49665534] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:10:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659876216] [2022-04-28 09:10:35,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:10:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:10:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:10:35,332 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:10:35,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 09:10:35,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:10:35,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:10:35,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 09:10:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:10:35,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:10:36,067 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-28 09:10:36,068 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-28 09:10:36,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {94662#true} call ULTIMATE.init(); {94662#true} is VALID [2022-04-28 09:10:36,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {94662#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); {94662#true} is VALID [2022-04-28 09:10:36,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-28 09:10:36,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-28 09:10:36,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-28 09:10:36,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {94662#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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {94667#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {94667#(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); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {94668#(and (= |main_~#vogal_array~0.offset| 0) (= main_~n_caracter~0 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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {94667#(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 + ~n_caracter~0 % 4294967296, 1); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {94667#(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; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {94667#(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 + ~n_caracter~0 % 4294967296, 1); {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:10:36,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {94667#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {94764#(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; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:10:36,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {94764#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {94792#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:36,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {94792#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:36,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:36,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:36,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {94796#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94806#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:10:36,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {94806#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94810#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} is VALID [2022-04-28 09:10:36,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {94810#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) |main_#t~mem8|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) |main_#t~mem9|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(~j~0 % 4294967296 < 2); {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {94679#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} ~i~0 := 0;~cont_aux~0 := 0; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} 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; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(~j~0 % 4294967296 < 2); {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {94680#(and (= |main_~#vogal_array~0.offset| 0) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94859#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {94859#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94859#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {94859#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {94866#(and (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94876#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} is VALID [2022-04-28 09:10:36,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {94876#(and (= |main_~#vogal_array~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) 1) (select (select |#memory_int| |main_~#vogal_array~0.base|) 1))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94880#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {94880#(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; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {94663#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {94663#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {94663#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L272 TraceCheckUtils]: 68: Hoare triple {94663#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-28 09:10:36,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-28 09:10:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 46 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 09:10:36,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:10:36,397 INFO L356 Elim1Store]: treesize reduction 27, result has 72.2 percent of original size [2022-04-28 09:10:36,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 77 [2022-04-28 09:10:36,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L272 TraceCheckUtils]: 68: Hoare triple {94663#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {94663#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {94663#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {94663#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94663#false} is VALID [2022-04-28 09:10:36,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {94880#(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; {94663#false} is VALID [2022-04-28 09:10:36,695 INFO L290 TraceCheckUtils]: 61: Hoare triple {94941#(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|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94880#(not (= |main_#t~mem14| |main_#t~mem13|))} is VALID [2022-04-28 09:10:36,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94941#(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|))))} is VALID [2022-04-28 09:10:36,696 INFO L290 TraceCheckUtils]: 59: Hoare triple {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:10:36,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:10:36,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {94955#(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| 1))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94945#(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 1) 4294967296) |main_~#vogal_array~0.offset|))))} is VALID [2022-04-28 09:10:36,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {94955#(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| 1))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94955#(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| 1))))} is VALID [2022-04-28 09:10:36,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {94955#(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| 1))))} is VALID [2022-04-28 09:10:36,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} assume !(~j~0 % 4294967296 < 2); {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 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; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} ~i~0 := 0;~cont_aux~0 := 0; {94962#(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|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296)))))} is VALID [2022-04-28 09:10:36,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:10:36,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:10:36,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} assume !(~j~0 % 4294967296 < 2); {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:10:36,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:10:36,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {95009#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (= |main_#t~mem9| |main_#t~mem8|))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {94993#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))} is VALID [2022-04-28 09:10:36,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {95013#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {95009#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (= |main_#t~mem9| |main_#t~mem8|))} is VALID [2022-04-28 09:10:36,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {95013#(and (= (mod main_~j~0 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:10:36,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:10:36,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:10:36,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {95027#(= (mod main_~i~0 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {95017#(and (= (mod (+ main_~j~0 1) 4294967296) 1) (= (mod main_~i~0 4294967296) 1))} is VALID [2022-04-28 09:10:36,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {95027#(= (mod main_~i~0 4294967296) 1)} is VALID [2022-04-28 09:10:36,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(~j~0 % 4294967296 < 2); {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {95031#(= (mod (+ main_~i~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; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {94662#true} ~cont~0 := 0;~i~0 := 0; {95031#(= (mod (+ main_~i~0 1) 4294967296) 1)} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {94662#true} assume !(0 != #t~mem4);havoc #t~mem4; {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {94662#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {94662#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {94662#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {94662#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {94662#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {94662#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {94662#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {94662#true} assume !(~i~0 % 4294967296 < 5); {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {94662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {94662#true} is VALID [2022-04-28 09:10:36,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {94662#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {94662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {94662#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {94662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {94662#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {94662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {94662#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {94662#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {94662#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {94662#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; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {94662#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); {94662#true} is VALID [2022-04-28 09:10:36,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {94662#true} call ULTIMATE.init(); {94662#true} is VALID [2022-04-28 09:10:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 09:10:36,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659876216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:10:36,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:10:36,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 40 [2022-04-28 09:10:36,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:10:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265287972] [2022-04-28 09:10:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265287972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:10:36,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:10:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 09:10:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998999553] [2022-04-28 09:10:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:10:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 72 [2022-04-28 09:10:36,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:10:36,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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-28 09:10:36,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 09:10:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:10:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 09:10:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:10:36,766 INFO L87 Difference]: Start difference. First operand 760 states and 874 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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-28 09:10:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:10:55,947 INFO L93 Difference]: Finished difference Result 1436 states and 1645 transitions. [2022-04-28 09:10:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:10:55,947 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 72 [2022-04-28 09:10:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:10:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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-28 09:10:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-28 09:10:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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-28 09:10:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-28 09:10:55,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2022-04-28 09:10:56,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:10:56,155 INFO L225 Difference]: With dead ends: 1436 [2022-04-28 09:10:56,155 INFO L226 Difference]: Without dead ends: 1236 [2022-04-28 09:10:56,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=462, Invalid=2730, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 09:10:56,156 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 238 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:10:56,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 97 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 09:10:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-28 09:11:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 948. [2022-04-28 09:11:08,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:11:08,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1236 states. Second operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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-28 09:11:08,827 INFO L74 IsIncluded]: Start isIncluded. First operand 1236 states. Second operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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-28 09:11:08,828 INFO L87 Difference]: Start difference. First operand 1236 states. Second operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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-28 09:11:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:11:08,864 INFO L93 Difference]: Finished difference Result 1236 states and 1400 transitions. [2022-04-28 09:11:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1400 transitions. [2022-04-28 09:11:08,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:11:08,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:11:08,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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 1236 states. [2022-04-28 09:11:08,866 INFO L87 Difference]: Start difference. First operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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 1236 states. [2022-04-28 09:11:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:11:08,920 INFO L93 Difference]: Finished difference Result 1236 states and 1400 transitions. [2022-04-28 09:11:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1400 transitions. [2022-04-28 09:11:08,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:11:08,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:11:08,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:11:08,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:11:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 943 states have (on average 1.1431601272534464) internal successors, (1078), 943 states have internal predecessors, (1078), 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-28 09:11:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1082 transitions. [2022-04-28 09:11:08,967 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1082 transitions. Word has length 72 [2022-04-28 09:11:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:11:08,967 INFO L495 AbstractCegarLoop]: Abstraction has 948 states and 1082 transitions. [2022-04-28 09:11:08,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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-28 09:11:08,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 948 states and 1082 transitions. [2022-04-28 09:11:15,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1082 edges. 1082 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:11:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1082 transitions. [2022-04-28 09:11:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 09:11:15,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:11:15,027 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 5, 5, 4, 4, 3, 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] [2022-04-28 09:11:15,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 09:11:15,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 09:11:15,228 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:11:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:11:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2132024177, now seen corresponding path program 29 times [2022-04-28 09:11:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:11:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1424746231] [2022-04-28 09:11:15,233 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:11:15,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:11:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2132024177, now seen corresponding path program 30 times [2022-04-28 09:11:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:11:15,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939817305] [2022-04-28 09:11:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:11:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:11:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:11:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:11:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:11:15,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {102425#(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); {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {102410#true} call ULTIMATE.init(); {102425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:11:15,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {102425#(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); {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-28 09:11:15,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {102410#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; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {102410#true} assume !(~i~0 % 4294967296 < 5); {102410#true} is VALID [2022-04-28 09:11:15,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {102410#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {102410#true} is VALID [2022-04-28 09:11:15,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {102410#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {102415#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:11:15,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {102415#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102415#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:11:15,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {102415#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102416#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {102416#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102416#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {102416#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102417#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:11:15,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {102417#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102417#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:11:15,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {102417#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102418#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {102418#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102418#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {102418#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102419#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:11:15,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {102419#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102419#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:11:15,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {102419#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102420#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:11:15,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {102420#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102420#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:11:15,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {102420#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102421#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:11:15,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {102421#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102421#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:11:15,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {102421#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {102422#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} assume !(~j~0 % 4294967296 < 2); {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:11:15,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {102423#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 7 main_~n_caracter~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {102424#(and (<= (+ main_~i~0 6) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {102424#(and (<= (+ main_~i~0 6) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {102411#false} ~i~0 := 0;~cont_aux~0 := 0; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {102411#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {102411#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {102411#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; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {102411#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-28 09:11:15,433 INFO L290 TraceCheckUtils]: 56: Hoare triple {102411#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {102411#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {102411#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {102411#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; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {102411#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {102411#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {102411#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L272 TraceCheckUtils]: 69: Hoare triple {102411#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-28 09:11:15,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-28 09:11:15,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-28 09:11:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:11:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:11:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939817305] [2022-04-28 09:11:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939817305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:11:15,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930284980] [2022-04-28 09:11:15,437 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:11:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:11:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:11:15,443 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:11:15,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 09:11:15,619 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:11:15,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:11:15,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:11:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:11:15,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:11:18,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 09:11:18,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 09:11:18,502 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-28 09:11:18,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {102410#true} call ULTIMATE.init(); {102410#true} is VALID [2022-04-28 09:11:18,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {102410#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); {102410#true} is VALID [2022-04-28 09:11:18,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-28 09:11:18,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-28 09:11:18,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-28 09:11:18,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {102410#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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {102444#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {102444#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {102444#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {102444#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {102444#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {102444#(= |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; {102444#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:11:18,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {102444#(= |main_~#input_string~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102529#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:11:18,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {102529#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {102533#(and (= |main_~#input_string~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {102533#(and (= |main_~#input_string~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} ~cont~0 := 0;~i~0 := 0; {102537#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {102537#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !(~j~0 % 4294967296 < 2); {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {102541#(and (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {102566#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (< 0 (mod main_~n_caracter~0 4294967296)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:11:18,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {102566#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0) (< 0 (mod main_~n_caracter~0 4294967296)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {102570#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:11:18,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {102570#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:11:18,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {102574#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102605#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {102605#(and (exists ((aux_div_aux_mod_main_~n_caracter~0_35_46 Int) (aux_mod_aux_mod_main_~n_caracter~0_35_46 Int)) (and (< (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296)) 4294967296) (< 0 (+ aux_mod_aux_mod_main_~n_caracter~0_35_46 (* aux_div_aux_mod_main_~n_caracter~0_35_46 4294967296))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod aux_mod_aux_mod_main_~n_caracter~0_35_46 4294967296))) 0) (<= aux_mod_aux_mod_main_~n_caracter~0_35_46 1) (<= 0 aux_mod_aux_mod_main_~n_caracter~0_35_46))) (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102609#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {102609#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {102411#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; {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {102411#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102411#false} is VALID [2022-04-28 09:11:18,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {102411#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {102411#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L272 TraceCheckUtils]: 69: Hoare triple {102411#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-28 09:11:18,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-28 09:11:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-04-28 09:11:18,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:11:19,131 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-28 09:11:19,131 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 22 treesize of output 1 [2022-04-28 09:11:19,172 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L272 TraceCheckUtils]: 69: Hoare triple {102411#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {102411#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {102411#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {102411#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {102411#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {102411#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; {102411#false} is VALID [2022-04-28 09:11:19,173 INFO L290 TraceCheckUtils]: 59: Hoare triple {102411#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102411#false} is VALID [2022-04-28 09:11:19,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {102609#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-28 09:11:19,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {102700#(= (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 + ~i~0 % 4294967296, 1); {102609#(= |main_#t~mem11| 0)} is VALID [2022-04-28 09:11:19,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {102700#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|)) 0)} is VALID [2022-04-28 09:11:19,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !(~j~0 % 4294967296 < 2); {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {102735#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} ~i~0 := 0;~cont_aux~0 := 0; {102704#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0)} is VALID [2022-04-28 09:11:19,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {102739#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {102735#(= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0)} is VALID [2022-04-28 09:11:19,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {102739#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !(~j~0 % 4294967296 < 2); {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {102768#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {102743#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)))} is VALID [2022-04-28 09:11:19,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {102772#(or (< 1 (mod main_~n_caracter~0 4294967296)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (< 0 (mod main_~n_caracter~0 4294967296))))} ~cont~0 := 0;~i~0 := 0; {102768#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n_caracter~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {102776#(or (< 1 (mod main_~n_caracter~0 4294967296)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (= |main_#t~mem4| 0)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} assume !(0 != #t~mem4);havoc #t~mem4; {102772#(or (< 1 (mod main_~n_caracter~0 4294967296)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (< 0 (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102776#(or (< 1 (mod main_~n_caracter~0 4294967296)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)) 0) (not (= |main_#t~mem4| 0)) (not (< 0 (mod main_~n_caracter~0 4294967296))))} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {102410#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {102410#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {102410#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {102410#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {102410#true} assume !(~i~0 % 4294967296 < 5); {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:19,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {102410#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {102410#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {102410#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; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {102410#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); {102410#true} is VALID [2022-04-28 09:11:19,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {102410#true} call ULTIMATE.init(); {102410#true} is VALID [2022-04-28 09:11:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-04-28 09:11:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930284980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:11:19,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:11:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-04-28 09:11:19,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:11:19,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1424746231] [2022-04-28 09:11:19,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1424746231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:11:19,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:11:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:11:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809391009] [2022-04-28 09:11:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:11:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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 73 [2022-04-28 09:11:19,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:11:19,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-28 09:11:19,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:11:19,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:11:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:11:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:11:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:11:19,218 INFO L87 Difference]: Start difference. First operand 948 states and 1082 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-28 09:12:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:07,023 INFO L93 Difference]: Finished difference Result 3393 states and 3886 transitions. [2022-04-28 09:12:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:12:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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 73 [2022-04-28 09:12:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-28 09:12:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-04-28 09:12:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-28 09:12:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-04-28 09:12:07,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 239 transitions. [2022-04-28 09:12:07,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:07,700 INFO L225 Difference]: With dead ends: 3393 [2022-04-28 09:12:07,700 INFO L226 Difference]: Without dead ends: 3344 [2022-04-28 09:12:07,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:12:07,701 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 316 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:07,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 165 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 09:12:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-04-28 09:12:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 950. [2022-04-28 09:12:20,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:20,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3344 states. Second operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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-28 09:12:20,334 INFO L74 IsIncluded]: Start isIncluded. First operand 3344 states. Second operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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-28 09:12:20,334 INFO L87 Difference]: Start difference. First operand 3344 states. Second operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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-28 09:12:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:20,624 INFO L93 Difference]: Finished difference Result 3344 states and 3830 transitions. [2022-04-28 09:12:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 3830 transitions. [2022-04-28 09:12:20,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:20,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:20,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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 3344 states. [2022-04-28 09:12:20,627 INFO L87 Difference]: Start difference. First operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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 3344 states. [2022-04-28 09:12:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:20,931 INFO L93 Difference]: Finished difference Result 3344 states and 3830 transitions. [2022-04-28 09:12:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 3830 transitions. [2022-04-28 09:12:20,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:20,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:20,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:20,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 945 states have (on average 1.143915343915344) internal successors, (1081), 945 states have internal predecessors, (1081), 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-28 09:12:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1085 transitions. [2022-04-28 09:12:20,967 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1085 transitions. Word has length 73 [2022-04-28 09:12:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:20,967 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1085 transitions. [2022-04-28 09:12:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 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-28 09:12:20,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 950 states and 1085 transitions. [2022-04-28 09:12:27,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1085 edges. 1085 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1085 transitions. [2022-04-28 09:12:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 09:12:27,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:27,345 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-04-28 09:12:27,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 09:12:27,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 09:12:27,545 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1623991599, now seen corresponding path program 31 times [2022-04-28 09:12:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:27,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186492548] [2022-04-28 09:12:27,551 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:12:27,551 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:12:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1623991599, now seen corresponding path program 32 times [2022-04-28 09:12:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733990994] [2022-04-28 09:12:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:27,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {118290#(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); {118277#true} is VALID [2022-04-28 09:12:27,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-28 09:12:27,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {118277#true} call ULTIMATE.init(); {118290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {118290#(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); {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {118277#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; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:27,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {118277#true} assume !(~i~0 % 4294967296 < 5); {118277#true} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {118277#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {118277#true} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {118277#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {118282#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:12:27,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {118282#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118282#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:12:27,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {118282#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {118283#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {118283#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118283#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {118283#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {118284#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:12:27,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {118284#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118284#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:12:27,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {118284#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {118285#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {118286#(and (<= main_~n_caracter~0 3) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {118286#(and (<= main_~n_caracter~0 3) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} assume !(~j~0 % 4294967296 < 2); {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {118287#(and (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0) (<= 3 main_~n_caracter~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} assume !(~j~0 % 4294967296 < 2); {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:12:27,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {118288#(and (<= (+ main_~i~0 2) main_~n_caracter~0) (<= (* 4294967296 (div main_~n_caracter~0 4294967296)) (+ main_~i~0 1)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118289#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~n_caracter~0))} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {118289#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 1) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {118278#false} ~i~0 := 0;~cont_aux~0 := 0; {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {118278#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {118278#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {118278#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {118278#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; {118278#false} is VALID [2022-04-28 09:12:27,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {118278#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {118278#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {118278#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 55: Hoare triple {118278#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 56: Hoare triple {118278#false} assume !(~j~0 % 4294967296 < 2); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {118278#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {118278#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {118278#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {118278#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {118278#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {118278#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {118278#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {118278#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {118278#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {118278#false} assume !(~j~0 % 4294967296 < 2); {118278#false} is VALID [2022-04-28 09:12:27,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {118278#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {118278#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {118278#false} assume !(0 != #t~mem11);havoc #t~mem11; {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L272 TraceCheckUtils]: 70: Hoare triple {118278#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-28 09:12:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 09:12:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:27,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733990994] [2022-04-28 09:12:27,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733990994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:12:27,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029862246] [2022-04-28 09:12:27,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:12:27,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:12:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:27,717 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:12:27,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 09:12:27,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:12:27,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:12:27,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:12:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:27,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:12:28,333 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-28 09:12:28,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {118277#true} call ULTIMATE.init(); {118277#true} is VALID [2022-04-28 09:12:28,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {118277#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); {118277#true} is VALID [2022-04-28 09:12:28,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-28 09:12:28,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-28 09:12:28,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-28 09:12:28,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {118277#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; {118309#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {118309#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118309#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {118309#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118316#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {118316#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118316#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {118316#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {118323#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {118323#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {118323#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {118323#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:12:28,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {118323#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {118351#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {118351#(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 + ~n_caracter~0 % 4294967296, 1); {118351#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {118351#(and (= main_~n_caracter~0 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; {118358#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {118358#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118358#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {118358#(and (= main_~n_caracter~0 1) (= |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; {118365#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:12:28,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {118365#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118369#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:12:28,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {118369#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {118373#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:12:28,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {118443#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,371 INFO L290 TraceCheckUtils]: 62: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,371 INFO L290 TraceCheckUtils]: 63: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,372 INFO L290 TraceCheckUtils]: 66: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:12:28,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {118474#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118505#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:12:28,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {118505#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118509#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:12:28,373 INFO L290 TraceCheckUtils]: 69: Hoare triple {118509#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {118278#false} is VALID [2022-04-28 09:12:28,373 INFO L272 TraceCheckUtils]: 70: Hoare triple {118278#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {118278#false} is VALID [2022-04-28 09:12:28,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-28 09:12:28,374 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-28 09:12:28,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-28 09:12:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 09:12:28,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:12:28,609 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:12:28,609 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 22 treesize of output 13 [2022-04-28 09:12:28,706 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-28 09:12:28,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-28 09:12:28,707 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-28 09:12:28,707 INFO L272 TraceCheckUtils]: 70: Hoare triple {118278#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {118278#false} is VALID [2022-04-28 09:12:28,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {118509#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {118278#false} is VALID [2022-04-28 09:12:28,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {118540#(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 + ~i~0 % 4294967296, 1); {118509#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:12:28,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118540#(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-28 09:12:28,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {118544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:12:28,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {118575#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {118676#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {118606#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:12:28,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {118680#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118676#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:12:28,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {118684#(= 2 (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; {118680#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:12:28,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {118684#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118684#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:12:28,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {118691#(= 2 (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; {118684#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:12:28,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {118691#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {118691#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {118277#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {118691#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {118277#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {118277#true} assume !(~i~0 % 4294967296 < 5); {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:28,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {118277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {118277#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {118277#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; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {118277#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); {118277#true} is VALID [2022-04-28 09:12:28,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {118277#true} call ULTIMATE.init(); {118277#true} is VALID [2022-04-28 09:12:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 09:12:28,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029862246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:12:28,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:12:28,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 31 [2022-04-28 09:12:28,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:28,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186492548] [2022-04-28 09:12:28,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186492548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:28,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:28,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:12:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444293348] [2022-04-28 09:12:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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 74 [2022-04-28 09:12:28,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:28,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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-28 09:12:28,767 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-28 09:12:28,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:12:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:12:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2022-04-28 09:12:28,769 INFO L87 Difference]: Start difference. First operand 950 states and 1085 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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-28 09:12:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:55,708 INFO L93 Difference]: Finished difference Result 1934 states and 2199 transitions. [2022-04-28 09:12:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:12:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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 74 [2022-04-28 09:12:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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-28 09:12:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2022-04-28 09:12:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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-28 09:12:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2022-04-28 09:12:55,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2022-04-28 09:12:55,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:55,984 INFO L225 Difference]: With dead ends: 1934 [2022-04-28 09:12:55,984 INFO L226 Difference]: Without dead ends: 1809 [2022-04-28 09:12:55,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:12:55,986 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 238 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:55,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 81 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:12:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-04-28 09:13:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1032. [2022-04-28 09:13:10,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:13:10,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1809 states. Second operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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-28 09:13:10,008 INFO L74 IsIncluded]: Start isIncluded. First operand 1809 states. Second operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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-28 09:13:10,008 INFO L87 Difference]: Start difference. First operand 1809 states. Second operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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-28 09:13:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:13:10,146 INFO L93 Difference]: Finished difference Result 1809 states and 2058 transitions. [2022-04-28 09:13:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2058 transitions. [2022-04-28 09:13:10,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:13:10,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:13:10,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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 1809 states. [2022-04-28 09:13:10,149 INFO L87 Difference]: Start difference. First operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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 1809 states. [2022-04-28 09:13:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:13:10,287 INFO L93 Difference]: Finished difference Result 1809 states and 2058 transitions. [2022-04-28 09:13:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2058 transitions. [2022-04-28 09:13:10,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:13:10,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:13:10,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:13:10,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:13:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1027 states have (on average 1.1402142161635833) internal successors, (1171), 1027 states have internal predecessors, (1171), 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-28 09:13:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1175 transitions. [2022-04-28 09:13:10,347 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1175 transitions. Word has length 74 [2022-04-28 09:13:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:13:10,348 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1175 transitions. [2022-04-28 09:13:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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-28 09:13:10,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1032 states and 1175 transitions. [2022-04-28 09:13:18,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1175 edges. 1175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:13:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1175 transitions. [2022-04-28 09:13:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 09:13:18,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:13:18,010 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 5, 5, 4, 4, 3, 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] [2022-04-28 09:13:18,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 09:13:18,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:13:18,211 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:13:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:13:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash 583415094, now seen corresponding path program 33 times [2022-04-28 09:13:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:13:18,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449937326] [2022-04-28 09:13:18,215 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:13:18,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:13:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 583415094, now seen corresponding path program 34 times [2022-04-28 09:13:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:13:18,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581315072] [2022-04-28 09:13:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:13:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:13:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:13:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:13:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:13:18,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {128338#(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); {128322#true} is VALID [2022-04-28 09:13:18,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-28 09:13:18,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-28 09:13:18,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {128322#true} call ULTIMATE.init(); {128338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:13:18,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {128338#(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); {128322#true} is VALID [2022-04-28 09:13:18,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {128322#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; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {128322#true} assume !(~i~0 % 4294967296 < 5); {128322#true} is VALID [2022-04-28 09:13:18,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {128322#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {128322#true} is VALID [2022-04-28 09:13:18,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {128322#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {128327#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:13:18,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {128327#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128327#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:13:18,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {128327#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128328#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {128328#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128328#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {128328#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128329#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:13:18,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {128329#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128329#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:13:18,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {128329#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128330#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {128330#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128330#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {128330#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128331#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:13:18,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {128331#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128331#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:13:18,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {128331#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128332#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:13:18,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {128332#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128332#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:13:18,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {128332#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128333#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:13:18,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {128333#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128333#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:13:18,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {128333#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128334#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {128334#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128334#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {128334#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} is VALID [2022-04-28 09:13:18,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} is VALID [2022-04-28 09:13:18,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} assume !(0 != #t~mem4);havoc #t~mem4; {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} is VALID [2022-04-28 09:13:18,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {128335#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} ~cont~0 := 0;~i~0 := 0; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~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; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:18,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {128336#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= 8 main_~n_caracter~0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {128337#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ 7 main_~i~0) main_~n_caracter~0))} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {128337#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ 7 main_~i~0) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {128323#false} ~i~0 := 0;~cont_aux~0 := 0; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {128323#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {128323#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 51: Hoare triple {128323#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {128323#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; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {128323#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {128323#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {128323#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {128323#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {128323#false} assume !(~j~0 % 4294967296 < 2); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {128323#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 59: Hoare triple {128323#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {128323#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128323#false} is VALID [2022-04-28 09:13:18,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {128323#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {128323#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; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {128323#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {128323#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {128323#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {128323#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {128323#false} assume !(~j~0 % 4294967296 < 2); {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {128323#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {128323#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {128323#false} assume !(0 != #t~mem11);havoc #t~mem11; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L272 TraceCheckUtils]: 71: Hoare triple {128323#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-28 09:13:18,427 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-28 09:13:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:13:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:13:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581315072] [2022-04-28 09:13:18,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581315072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:13:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305544673] [2022-04-28 09:13:18,428 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:13:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:13:18,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:13:18,429 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:13:18,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 09:13:18,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:13:18,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:13:18,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:13:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:13:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:13:19,080 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-28 09:13:19,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {128322#true} call ULTIMATE.init(); {128322#true} is VALID [2022-04-28 09:13:19,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {128322#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); {128322#true} is VALID [2022-04-28 09:13:19,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-28 09:13:19,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-28 09:13:19,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-28 09:13:19,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {128322#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; {128357#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {128357#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128357#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {128357#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128364#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {128364#(and (= main_~i~0 1) (= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128364#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {128364#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {128371#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {128371#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {128371#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {128371#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:13:19,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {128371#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {128399#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {128399#(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 + ~n_caracter~0 % 4294967296, 1); {128399#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {128399#(and (= main_~n_caracter~0 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; {128406#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {128406#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128406#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {128406#(and (= (+ (- 1) main_~n_caracter~0) 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; {128413#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} is VALID [2022-04-28 09:13:19,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {128413#(and (= |main_~#input_string~0.offset| 0) (= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128417#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:13:19,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {128417#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {128421#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,123 INFO L290 TraceCheckUtils]: 54: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,124 INFO L290 TraceCheckUtils]: 57: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:13:19,124 INFO L290 TraceCheckUtils]: 58: Hoare triple {128494#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,126 INFO L290 TraceCheckUtils]: 61: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,126 INFO L290 TraceCheckUtils]: 62: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~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; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,126 INFO L290 TraceCheckUtils]: 63: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:13:19,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {128525#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128556#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:13:19,129 INFO L290 TraceCheckUtils]: 69: Hoare triple {128556#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128560#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:13:19,129 INFO L290 TraceCheckUtils]: 70: Hoare triple {128560#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {128323#false} is VALID [2022-04-28 09:13:19,129 INFO L272 TraceCheckUtils]: 71: Hoare triple {128323#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {128323#false} is VALID [2022-04-28 09:13:19,129 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-28 09:13:19,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-28 09:13:19,129 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-28 09:13:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 09:13:19,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:13:19,377 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:13:19,377 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 22 treesize of output 13 [2022-04-28 09:13:19,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-28 09:13:19,500 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-28 09:13:19,500 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-28 09:13:19,500 INFO L272 TraceCheckUtils]: 71: Hoare triple {128323#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {128323#false} is VALID [2022-04-28 09:13:19,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {128560#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {128323#false} is VALID [2022-04-28 09:13:19,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {128591#(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 + ~i~0 % 4294967296, 1); {128560#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:13:19,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128591#(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-28 09:13:19,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {128595#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:13:19,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {128626#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {128730#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {128657#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:13:19,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {128734#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128730#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:13:19,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {128738#(= 2 (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; {128734#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:13:19,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {128738#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128738#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:13:19,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {128745#(= 2 (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; {128738#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:13:19,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {128745#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {128745#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:13:19,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {128322#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {128745#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {128322#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {128322#true} assume !(~i~0 % 4294967296 < 5); {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {128322#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {128322#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {128322#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; {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-28 09:13:19,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-28 09:13:19,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-28 09:13:19,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {128322#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); {128322#true} is VALID [2022-04-28 09:13:19,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {128322#true} call ULTIMATE.init(); {128322#true} is VALID [2022-04-28 09:13:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-28 09:13:19,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305544673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:13:19,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:13:19,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 34 [2022-04-28 09:13:19,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:13:19,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449937326] [2022-04-28 09:13:19,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449937326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:13:19,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:13:19,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:13:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098303527] [2022-04-28 09:13:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:13:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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 75 [2022-04-28 09:13:19,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:13:19,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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-28 09:13:19,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:13:19,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:13:19,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:13:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:13:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:13:19,557 INFO L87 Difference]: Start difference. First operand 1032 states and 1175 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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-28 09:14:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:14:18,861 INFO L93 Difference]: Finished difference Result 3883 states and 4447 transitions. [2022-04-28 09:14:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:14:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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 75 [2022-04-28 09:14:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:14:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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-28 09:14:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 262 transitions. [2022-04-28 09:14:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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-28 09:14:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 262 transitions. [2022-04-28 09:14:18,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 262 transitions. [2022-04-28 09:14:19,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:14:19,672 INFO L225 Difference]: With dead ends: 3883 [2022-04-28 09:14:19,672 INFO L226 Difference]: Without dead ends: 3834 [2022-04-28 09:14:19,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 09:14:19,674 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 346 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:14:19,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 189 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 09:14:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-04-28 09:14:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 1034. [2022-04-28 09:14:34,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:14:34,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3834 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:14:34,275 INFO L74 IsIncluded]: Start isIncluded. First operand 3834 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:14:34,276 INFO L87 Difference]: Start difference. First operand 3834 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:14:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:14:34,671 INFO L93 Difference]: Finished difference Result 3834 states and 4391 transitions. [2022-04-28 09:14:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4391 transitions. [2022-04-28 09:14:34,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:14:34,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:14:34,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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 3834 states. [2022-04-28 09:14:34,676 INFO L87 Difference]: Start difference. First operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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 3834 states. [2022-04-28 09:14:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:14:35,092 INFO L93 Difference]: Finished difference Result 3834 states and 4391 transitions. [2022-04-28 09:14:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4391 transitions. [2022-04-28 09:14:35,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:14:35,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:14:35,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:14:35,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:14:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:14:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1178 transitions. [2022-04-28 09:14:35,140 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1178 transitions. Word has length 75 [2022-04-28 09:14:35,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:14:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1178 transitions. [2022-04-28 09:14:35,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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-28 09:14:35,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1034 states and 1178 transitions. [2022-04-28 09:14:42,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1178 edges. 1178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:14:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1178 transitions. [2022-04-28 09:14:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 09:14:42,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:14:42,830 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2022-04-28 09:14:42,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 09:14:43,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 09:14:43,030 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:14:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:14:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1908734380, now seen corresponding path program 35 times [2022-04-28 09:14:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:14:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63845140] [2022-04-28 09:14:43,035 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:14:43,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:14:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1908734380, now seen corresponding path program 36 times [2022-04-28 09:14:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:14:43,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781607249] [2022-04-28 09:14:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:14:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:14:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:14:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:14:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:14:43,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {146348#(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); {146334#true} is VALID [2022-04-28 09:14:43,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 09:14:43,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-28 09:14:43,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {146348#(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); {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:43,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:43,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:43,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {146334#true} assume !(~i~0 % 4294967296 < 5); {146334#true} is VALID [2022-04-28 09:14:43,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {146334#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {146334#true} is VALID [2022-04-28 09:14:43,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {146334#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {146339#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:14:43,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {146339#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146339#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:14:43,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {146339#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {146340#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:14:43,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {146340#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146340#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:14:43,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {146340#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {146341#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:14:43,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {146341#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146341#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:14:43,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {146341#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {146342#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:14:43,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {146342#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146342#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:14:43,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {146342#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:14:43,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:14:43,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !(0 != #t~mem4);havoc #t~mem4; {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:14:43,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {146343#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} ~cont~0 := 0;~i~0 := 0; {146344#(and (<= 4 main_~n_caracter~0) (= main_~i~0 0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:14:43,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {146344#(and (<= 4 main_~n_caracter~0) (= main_~i~0 0) (<= main_~n_caracter~0 4))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~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; {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {146345#(and (<= 4 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} assume !(~j~0 % 4294967296 < 2); {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {146346#(and (<= (+ main_~i~0 3) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (<= 1 main_~i~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146347#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~n_caracter~0))} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {146347#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (<= (+ main_~i~0 2) main_~n_caracter~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {146335#false} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {146335#false} ~i~0 := 0;~cont_aux~0 := 0; {146335#false} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {146335#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {146335#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146335#false} is VALID [2022-04-28 09:14:43,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {146335#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {146335#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; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {146335#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {146335#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {146335#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 57: Hoare triple {146335#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {146335#false} assume !(~j~0 % 4294967296 < 2); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {146335#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {146335#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {146335#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {146335#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {146335#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {146335#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {146335#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {146335#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146335#false} is VALID [2022-04-28 09:14:43,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {146335#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {146335#false} assume !(~j~0 % 4294967296 < 2); {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {146335#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {146335#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {146335#false} assume !(0 != #t~mem11);havoc #t~mem11; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L272 TraceCheckUtils]: 72: Hoare triple {146335#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-28 09:14:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 09:14:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:14:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781607249] [2022-04-28 09:14:43,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781607249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:14:43,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883300666] [2022-04-28 09:14:43,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:14:43,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:14:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:14:43,216 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:14:43,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 09:14:43,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 09:14:43,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:14:43,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 09:14:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:14:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:14:43,485 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 15 treesize of output 11 [2022-04-28 09:14:43,931 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-28 09:14:43,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146334#true} is VALID [2022-04-28 09:14:43,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#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); {146334#true} is VALID [2022-04-28 09:14:43,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 09:14:43,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-28 09:14:43,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-28 09:14:43,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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; {146367#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {146367#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146367#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {146367#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146374#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:14:43,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {146374#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) 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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146374#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:14:43,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {146374#(and (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {146381#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {146381#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {146381#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {146381#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:14:43,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {146381#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {146409#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {146409#(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 + ~n_caracter~0 % 4294967296, 1); {146409#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {146409#(and (= main_~n_caracter~0 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; {146416#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {146416#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146416#(and (= main_~n_caracter~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {146416#(and (= main_~n_caracter~0 1) (= |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; {146423#(and (= (+ (- 1) main_~n_caracter~0) 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {146423#(and (= (+ (- 1) main_~n_caracter~0) 1) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146427#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:14:43,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {146427#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {146431#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:14:43,969 INFO L290 TraceCheckUtils]: 59: Hoare triple {146507#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,972 INFO L290 TraceCheckUtils]: 67: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {146538#(and (= main_~i~0 1) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146569#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:14:43,973 INFO L290 TraceCheckUtils]: 70: Hoare triple {146569#(and (= main_~i~0 2) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146573#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:14:43,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {146573#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {146335#false} is VALID [2022-04-28 09:14:43,974 INFO L272 TraceCheckUtils]: 72: Hoare triple {146335#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {146335#false} is VALID [2022-04-28 09:14:43,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-28 09:14:43,974 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-28 09:14:43,974 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-28 09:14:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 09:14:43,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:14:44,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-28 09:14:44,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-28 09:14:44,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-28 09:14:44,316 INFO L272 TraceCheckUtils]: 72: Hoare triple {146335#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {146335#false} is VALID [2022-04-28 09:14:44,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {146573#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {146335#false} is VALID [2022-04-28 09:14:44,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {146604#(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 + ~i~0 % 4294967296, 1); {146573#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:14:44,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146604#(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-28 09:14:44,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {146608#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:14:44,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {146639#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {146746#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146670#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:14:44,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {146750#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146746#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:14:44,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {146754#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 1) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146750#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod main_~n_caracter~0 4294967296)))))} is VALID [2022-04-28 09:14:44,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {146754#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 1) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146754#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 1) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} is VALID [2022-04-28 09:14:44,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {146761#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 2) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {146754#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 1) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} is VALID [2022-04-28 09:14:44,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {146761#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 2) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {146761#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 2) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} is VALID [2022-04-28 09:14:44,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {146334#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {146761#(or (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~n_caracter~0 2) 4294967296))) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)))} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {146334#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {146334#true} assume !(~i~0 % 4294967296 < 5); {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {146334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {146334#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {146334#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; {146334#true} is VALID [2022-04-28 09:14:44,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-28 09:14:44,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-28 09:14:44,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-28 09:14:44,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#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); {146334#true} is VALID [2022-04-28 09:14:44,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146334#true} is VALID [2022-04-28 09:14:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-28 09:14:44,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883300666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:14:44,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:14:44,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 32 [2022-04-28 09:14:44,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:14:44,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63845140] [2022-04-28 09:14:44,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63845140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:14:44,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:14:44,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:14:44,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884532656] [2022-04-28 09:14:44,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:14:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 76 [2022-04-28 09:14:44,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:14:44,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-28 09:14:44,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:14:44,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:14:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:14:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:14:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:14:44,369 INFO L87 Difference]: Start difference. First operand 1034 states and 1178 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-28 09:15:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:21,391 INFO L93 Difference]: Finished difference Result 2385 states and 2721 transitions. [2022-04-28 09:15:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:15:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 76 [2022-04-28 09:15:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:15:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-28 09:15:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2022-04-28 09:15:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-28 09:15:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2022-04-28 09:15:21,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 202 transitions. [2022-04-28 09:15:21,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:15:21,763 INFO L225 Difference]: With dead ends: 2385 [2022-04-28 09:15:21,763 INFO L226 Difference]: Without dead ends: 2260 [2022-04-28 09:15:21,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:15:21,764 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 267 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:15:21,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 99 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 09:15:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2022-04-28 09:15:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1034. [2022-04-28 09:15:36,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:15:36,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2260 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:15:36,753 INFO L74 IsIncluded]: Start isIncluded. First operand 2260 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:15:36,754 INFO L87 Difference]: Start difference. First operand 2260 states. Second operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:15:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:36,875 INFO L93 Difference]: Finished difference Result 2260 states and 2580 transitions. [2022-04-28 09:15:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2580 transitions. [2022-04-28 09:15:36,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:36,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:36,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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 2260 states. [2022-04-28 09:15:36,877 INFO L87 Difference]: Start difference. First operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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 2260 states. [2022-04-28 09:15:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:15:37,006 INFO L93 Difference]: Finished difference Result 2260 states and 2580 transitions. [2022-04-28 09:15:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2580 transitions. [2022-04-28 09:15:37,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:15:37,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:15:37,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:15:37,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:15:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1029 states have (on average 1.1409135082604471) internal successors, (1174), 1029 states have internal predecessors, (1174), 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-28 09:15:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1178 transitions. [2022-04-28 09:15:37,046 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1178 transitions. Word has length 76 [2022-04-28 09:15:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:15:37,046 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1178 transitions. [2022-04-28 09:15:37,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-28 09:15:37,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1034 states and 1178 transitions. [2022-04-28 09:15:44,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1178 edges. 1178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:15:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1178 transitions. [2022-04-28 09:15:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 09:15:44,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:15:44,748 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 5, 5, 4, 4, 3, 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] [2022-04-28 09:15:44,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 09:15:44,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 09:15:44,948 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:15:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:15:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1571229253, now seen corresponding path program 37 times [2022-04-28 09:15:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:44,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715634278] [2022-04-28 09:15:44,952 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:15:44,952 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:15:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1571229253, now seen corresponding path program 38 times [2022-04-28 09:15:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:15:44,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528688506] [2022-04-28 09:15:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:15:44,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:15:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:15:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {158219#(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); {158202#true} is VALID [2022-04-28 09:15:45,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {158202#true} assume true; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158202#true} {158202#true} #133#return; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {158202#true} call ULTIMATE.init(); {158219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {158219#(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); {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {158202#true} assume true; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158202#true} {158202#true} #133#return; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {158202#true} call #t~ret17 := main(); {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {158202#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; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:45,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {158202#true} assume !(~i~0 % 4294967296 < 5); {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {158202#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {158202#true} is VALID [2022-04-28 09:15:45,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {158202#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {158207#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:15:45,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {158207#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158207#(= main_~n_caracter~0 0)} is VALID [2022-04-28 09:15:45,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {158207#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158208#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {158208#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158208#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {158208#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158209#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:15:45,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {158209#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158209#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2022-04-28 09:15:45,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {158209#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158210#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {158210#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158210#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {158210#(and (<= main_~n_caracter~0 3) (<= 3 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158211#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:15:45,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {158211#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158211#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} is VALID [2022-04-28 09:15:45,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {158211#(and (<= 4 main_~n_caracter~0) (<= main_~n_caracter~0 4))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158212#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:15:45,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {158212#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158212#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} is VALID [2022-04-28 09:15:45,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {158212#(and (<= 5 main_~n_caracter~0) (<= main_~n_caracter~0 5))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158213#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:15:45,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {158213#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158213#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} is VALID [2022-04-28 09:15:45,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {158213#(and (<= 6 main_~n_caracter~0) (<= main_~n_caracter~0 6))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158214#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {158214#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158214#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {158214#(and (<= main_~n_caracter~0 7) (<= 7 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158215#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} is VALID [2022-04-28 09:15:45,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {158215#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158215#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} is VALID [2022-04-28 09:15:45,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {158215#(and (<= 8 main_~n_caracter~0) (<= main_~n_caracter~0 8))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} assume !(0 != #t~mem4);havoc #t~mem4; {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {158216#(and (<= main_~n_caracter~0 9) (<= 9 main_~n_caracter~0))} ~cont~0 := 0;~i~0 := 0; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} assume !(~j~0 % 4294967296 < 2); {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {158217#(and (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)) (= main_~i~0 0) (<= 9 main_~n_caracter~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {158218#(and (<= (+ main_~i~0 8) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {158218#(and (<= (+ main_~i~0 8) main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {158203#false} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {158203#false} ~i~0 := 0;~cont_aux~0 := 0; {158203#false} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {158203#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {158203#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158203#false} is VALID [2022-04-28 09:15:45,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {158203#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 54: Hoare triple {158203#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; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {158203#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {158203#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {158203#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {158203#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {158203#false} assume !(~j~0 % 4294967296 < 2); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {158203#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {158203#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {158203#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {158203#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {158203#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; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {158203#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {158203#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {158203#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158203#false} is VALID [2022-04-28 09:15:45,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {158203#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {158203#false} assume !(~j~0 % 4294967296 < 2); {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {158203#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {158203#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {158203#false} assume !(0 != #t~mem11);havoc #t~mem11; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L272 TraceCheckUtils]: 73: Hoare triple {158203#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {158203#false} ~cond := #in~cond; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 75: Hoare triple {158203#false} assume 0 == ~cond; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L290 TraceCheckUtils]: 76: Hoare triple {158203#false} assume !false; {158203#false} is VALID [2022-04-28 09:15:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 09:15:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:15:45,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528688506] [2022-04-28 09:15:45,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528688506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:15:45,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132997459] [2022-04-28 09:15:45,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:15:45,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:15:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:15:45,173 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:15:45,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 09:15:45,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:15:45,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:15:45,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 09:15:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:15:45,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:15:45,831 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-28 09:15:45,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {158202#true} call ULTIMATE.init(); {158202#true} is VALID [2022-04-28 09:15:45,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {158202#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); {158202#true} is VALID [2022-04-28 09:15:45,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {158202#true} assume true; {158202#true} is VALID [2022-04-28 09:15:45,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158202#true} {158202#true} #133#return; {158202#true} is VALID [2022-04-28 09:15:45,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {158202#true} call #t~ret17 := main(); {158202#true} is VALID [2022-04-28 09:15:45,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {158202#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; {158238#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {158238#(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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158238#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {158238#(and (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158245#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {158245#(and (= main_~i~0 1) (= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158245#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {158245#(and (= main_~i~0 1) (= |main_~#input_string~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {158252#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {158252#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {158252#(= |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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {158252#(= |main_~#input_string~0.offset| 0)} is VALID [2022-04-28 09:15:45,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {158252#(= |main_~#input_string~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {158280#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {158280#(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 + ~n_caracter~0 % 4294967296, 1); {158280#(and (= main_~n_caracter~0 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {158280#(and (= main_~n_caracter~0 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; {158287#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {158287#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158287#(and (= (+ (- 1) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {158287#(and (= (+ (- 1) main_~n_caracter~0) 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; {158294#(and (= (+ (- 2) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {158294#(and (= (+ (- 2) main_~n_caracter~0) 0) (= |main_~#input_string~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158298#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) |main_#t~mem4|))} is VALID [2022-04-28 09:15:45,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {158298#(and (= |main_~#input_string~0.offset| 0) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~n_caracter~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {158302#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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 + ~i~0 % 4294967296, 1); {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,875 INFO L290 TraceCheckUtils]: 52: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~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; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 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 + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} is VALID [2022-04-28 09:15:45,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {158381#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~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; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} assume !(~j~0 % 4294967296 < 2); {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 09:15:45,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {158412#(and (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0) (= (+ (- 1) main_~i~0) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158443#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} is VALID [2022-04-28 09:15:45,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {158443#(and (= (+ (- 2) main_~i~0) 0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_~#input_string~0.offset| 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158447#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:15:45,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {158447#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {158203#false} is VALID [2022-04-28 09:15:45,883 INFO L272 TraceCheckUtils]: 73: Hoare triple {158203#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {158203#false} is VALID [2022-04-28 09:15:45,883 INFO L290 TraceCheckUtils]: 74: Hoare triple {158203#false} ~cond := #in~cond; {158203#false} is VALID [2022-04-28 09:15:45,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {158203#false} assume 0 == ~cond; {158203#false} is VALID [2022-04-28 09:15:45,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {158203#false} assume !false; {158203#false} is VALID [2022-04-28 09:15:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-28 09:15:45,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:15:46,138 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-28 09:15:46,139 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 22 treesize of output 13 [2022-04-28 09:15:46,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {158203#false} assume !false; {158203#false} is VALID [2022-04-28 09:15:46,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {158203#false} assume 0 == ~cond; {158203#false} is VALID [2022-04-28 09:15:46,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {158203#false} ~cond := #in~cond; {158203#false} is VALID [2022-04-28 09:15:46,249 INFO L272 TraceCheckUtils]: 73: Hoare triple {158203#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {158203#false} is VALID [2022-04-28 09:15:46,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {158447#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {158203#false} is VALID [2022-04-28 09:15:46,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {158478#(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 + ~i~0 % 4294967296, 1); {158447#(not (= |main_#t~mem11| 0))} is VALID [2022-04-28 09:15:46,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158478#(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-28 09:15:46,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(~j~0 % 4294967296 < 2); {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 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; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {158482#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (mod (+ main_~i~0 1) 4294967296))) 0))} is VALID [2022-04-28 09:15:46,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !(#t~mem13 == #t~mem14);havoc #t~mem13;havoc #t~mem14; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 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; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1); {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~i~0 := 0;~cont_aux~0 := 0; {158513#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod (+ main_~i~0 2) 4294967296) |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(~j~0 % 4294967296 < 2); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(#t~mem8 == #t~mem9);havoc #t~mem8;havoc #t~mem9; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~i~0 % 4294967296, 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + ~j~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} ~cont~0 := 0;~i~0 := 0; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {158623#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |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; {158544#(not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0))} is VALID [2022-04-28 09:15:46,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {158627#(= 2 (mod main_~n_caracter~0 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158623#(or (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ 2 |main_~#input_string~0.offset|)) 0)) (= |main_#t~mem4| 0))} is VALID [2022-04-28 09:15:46,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {158631#(= 2 (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; {158627#(= 2 (mod main_~n_caracter~0 4294967296))} is VALID [2022-04-28 09:15:46,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {158631#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158631#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:15:46,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {158638#(= 2 (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; {158631#(= 2 (mod (+ main_~n_caracter~0 1) 4294967296))} is VALID [2022-04-28 09:15:46,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {158638#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + ~n_caracter~0 % 4294967296, 1); {158638#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {158202#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {158638#(= 2 (mod (+ main_~n_caracter~0 2) 4294967296))} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {158202#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {158202#true} assume !(~i~0 % 4294967296 < 5); {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:46,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {158202#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {158202#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 + ~i~0 % 4294967296, 1);havoc #t~nondet2; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {158202#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; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {158202#true} call #t~ret17 := main(); {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158202#true} {158202#true} #133#return; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {158202#true} assume true; {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {158202#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); {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {158202#true} call ULTIMATE.init(); {158202#true} is VALID [2022-04-28 09:15:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 65 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-04-28 09:15:46,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132997459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:15:46,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:15:46,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 35 [2022-04-28 09:15:46,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:15:46,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715634278] [2022-04-28 09:15:46,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715634278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:15:46,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:15:46,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 09:15:46,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481473605] [2022-04-28 09:15:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:15:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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 77 [2022-04-28 09:15:46,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:15:46,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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-28 09:15:46,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:15:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 09:15:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:15:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 09:15:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:15:46,323 INFO L87 Difference]: Start difference. First operand 1034 states and 1178 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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)