/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-e106359-m [2022-04-15 12:05:23,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:05:23,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:05:23,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:05:23,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:05:23,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:05:23,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:05:23,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:05:23,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:05:23,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:05:23,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:05:23,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:05:23,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:05:23,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:05:23,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:05:23,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:05:23,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:05:23,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:05:23,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:05:23,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:05:23,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:05:23,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:05:23,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:05:23,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:05:23,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:05:23,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:05:23,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:05:23,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:05:23,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:05:23,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:05:23,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:05:23,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:05:23,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:05:23,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:05:23,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:05:23,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:05:23,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:05:23,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:05:23,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:05:23,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:05:23,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:05:23,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:05:23,988 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:05:24,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:05:24,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:05:24,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:05:24,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:05:24,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:05:24,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:05:24,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:05:24,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:05:24,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:05:24,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:05:24,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:05:24,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:05:24,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:05:24,007 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:05:24,007 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:05:24,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:05:24,007 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:05:24,007 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-15 12:05:24,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:05:24,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:05:24,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:05:24,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:05:24,258 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:05:24,259 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-15 12:05:24,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d2d1688/981ead8ddd93444f803c5bc9a7193472/FLAG8ce337bfb [2022-04-15 12:05:24,720 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:05:24,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2022-04-15 12:05:24,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d2d1688/981ead8ddd93444f803c5bc9a7193472/FLAG8ce337bfb [2022-04-15 12:05:25,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22d2d1688/981ead8ddd93444f803c5bc9a7193472 [2022-04-15 12:05:25,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:05:25,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:05:25,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:05:25,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:05:25,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:05:25,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2005bdd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25, skipping insertion in model container [2022-04-15 12:05:25,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:05:25,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:05:25,381 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-15 12:05:25,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:05:25,441 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:05:25,458 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-15 12:05:25,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:05:25,493 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:05:25,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25 WrapperNode [2022-04-15 12:05:25,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:05:25,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:05:25,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:05:25,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:05:25,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:05:25,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:05:25,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:05:25,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:05:25,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (1/1) ... [2022-04-15 12:05:25,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:05:25,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:25,584 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-15 12:05:25,608 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-15 12:05:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:05:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:05:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:05:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:05:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:05:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:05:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:05:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:05:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:05:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:05:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:05:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:05:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:05:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:05:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 12:05:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:05:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:05:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:05:25,712 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:05:25,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:05:25,961 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:05:25,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:05:25,967 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 12:05:25,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:25 BoogieIcfgContainer [2022-04-15 12:05:25,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:05:25,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:05:25,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:05:25,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:05:25,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:05:25" (1/3) ... [2022-04-15 12:05:25,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b26bbac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:25, skipping insertion in model container [2022-04-15 12:05:25,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:25" (2/3) ... [2022-04-15 12:05:25,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b26bbac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:25, skipping insertion in model container [2022-04-15 12:05:25,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:25" (3/3) ... [2022-04-15 12:05:25,982 INFO L111 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2022-04-15 12:05:25,986 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:05:25,986 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:05:26,032 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:05:26,040 INFO L340 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 [2022-04-15 12:05:26,040 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:05:26,070 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-15 12:05:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:05:26,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:26,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:26,078 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -366742854, now seen corresponding path program 1 times [2022-04-15 12:05:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:26,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460811558] [2022-04-15 12:05:26,101 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:05:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash -366742854, now seen corresponding path program 2 times [2022-04-15 12:05:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:26,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830366636] [2022-04-15 12:05:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:26,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:26,334 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-15 12:05:26,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 12:05:26,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-15 12:05:26,338 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-15 12:05:26,338 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-15 12:05:26,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 12:05:26,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #133#return; {40#true} is VALID [2022-04-15 12:05:26,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2022-04-15 12:05:26,339 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-15 12:05:26,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~i~0 % 4294967296 < 5); {40#true} is VALID [2022-04-15 12:05:26,340 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-15 12:05:26,340 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-15 12:05:26,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-04-15 12:05:26,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} ~cont~0 := 0;~i~0 := 0; {41#false} is VALID [2022-04-15 12:05:26,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {41#false} is VALID [2022-04-15 12:05:26,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~i~0 := 0;~cont_aux~0 := 0; {41#false} is VALID [2022-04-15 12:05:26,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 12:05:26,343 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-15 12:05:26,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 12:05:26,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 12:05:26,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 12:05:26,344 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-15 12:05:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:26,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830366636] [2022-04-15 12:05:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830366636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:26,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:26,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:05:26,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:26,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460811558] [2022-04-15 12:05:26,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460811558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:26,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:26,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:05:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121327999] [2022-04-15 12:05:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:26,354 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-15 12:05:26,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:26,358 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-15 12:05:26,385 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-15 12:05:26,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:05:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:05:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:05:26,409 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-15 12:05:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:26,497 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-15 12:05:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:05:26,498 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-15 12:05:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:26,499 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-15 12:05:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 12:05:26,506 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-15 12:05:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 12:05:26,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 12:05:26,606 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-15 12:05:26,614 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:05:26,614 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:05:26,616 INFO L912 BasicCegarLoop]: 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-15 12:05:26,619 INFO L913 BasicCegarLoop]: 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-15 12:05:26,623 INFO L914 BasicCegarLoop]: 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-15 12:05:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:05:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:05:26,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:26,665 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-15 12:05:26,666 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-15 12:05:26,667 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-15 12:05:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:26,674 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 12:05:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-15 12:05:26,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:26,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:26,675 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-15 12:05:26,675 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-15 12:05:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:26,678 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 12:05:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-15 12:05:26,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:26,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:26,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:26,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:26,679 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-15 12:05:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-04-15 12:05:26,682 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2022-04-15 12:05:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:26,682 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-04-15 12:05:26,683 INFO L479 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-15 12:05:26,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 37 transitions. [2022-04-15 12:05:26,732 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-15 12:05:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-15 12:05:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:05:26,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:26,733 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:26,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:05:26,733 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -864138192, now seen corresponding path program 1 times [2022-04-15 12:05:26,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:26,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402758651] [2022-04-15 12:05:26,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:05:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash -864138192, now seen corresponding path program 2 times [2022-04-15 12:05:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:26,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810719805] [2022-04-15 12:05:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:26,873 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-15 12:05:26,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-15 12:05:26,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {300#true} {300#true} #133#return; {300#true} is VALID [2022-04-15 12:05:26,875 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-15 12:05:26,875 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-15 12:05:26,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} assume true; {300#true} is VALID [2022-04-15 12:05:26,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#true} {300#true} #133#return; {300#true} is VALID [2022-04-15 12:05:26,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#true} call #t~ret17 := main(); {300#true} is VALID [2022-04-15 12:05:26,876 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-15 12:05:26,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 5); {301#false} is VALID [2022-04-15 12:05:26,877 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-15 12:05:26,878 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-15 12:05:26,878 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-15 12:05:26,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#false} assume !(0 != #t~mem4);havoc #t~mem4; {301#false} is VALID [2022-04-15 12:05:26,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#false} ~cont~0 := 0;~i~0 := 0; {301#false} is VALID [2022-04-15 12:05:26,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {301#false} is VALID [2022-04-15 12:05:26,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {301#false} ~i~0 := 0;~cont_aux~0 := 0; {301#false} is VALID [2022-04-15 12:05:26,879 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-15 12:05:26,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {301#false} assume !(0 != #t~mem11);havoc #t~mem11; {301#false} is VALID [2022-04-15 12:05:26,880 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-15 12:05:26,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {301#false} ~cond := #in~cond; {301#false} is VALID [2022-04-15 12:05:26,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {301#false} assume 0 == ~cond; {301#false} is VALID [2022-04-15 12:05:26,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {301#false} assume !false; {301#false} is VALID [2022-04-15 12:05:26,881 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-15 12:05:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:26,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810719805] [2022-04-15 12:05:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810719805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:26,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:26,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:05:26,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402758651] [2022-04-15 12:05:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402758651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:26,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:05:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284663656] [2022-04-15 12:05:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:26,888 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-15 12:05:26,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:26,888 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-15 12:05:26,906 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-15 12:05:26,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:05:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:05:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:05:26,908 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-15 12:05:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:27,103 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-15 12:05:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:05:27,103 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-15 12:05:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:27,105 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-15 12:05:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 12:05:27,125 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-15 12:05:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 12:05:27,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-15 12:05:27,412 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-15 12:05:27,414 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:05:27,414 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:05:27,415 INFO L912 BasicCegarLoop]: 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-15 12:05:27,416 INFO L913 BasicCegarLoop]: 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-15 12:05:27,416 INFO L914 BasicCegarLoop]: 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-15 12:05:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:05:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-15 12:05:27,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:27,427 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-15 12:05:27,428 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-15 12:05:27,428 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-15 12:05:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:27,438 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 12:05:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-15 12:05:27,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:27,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:27,440 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-15 12:05:27,441 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-15 12:05:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:27,447 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 12:05:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-15 12:05:27,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:27,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:27,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:27,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:27,451 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-15 12:05:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-15 12:05:27,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2022-04-15 12:05:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:27,455 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-15 12:05:27,456 INFO L479 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-15 12:05:27,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-15 12:05:27,545 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-15 12:05:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 12:05:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:05:27,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:27,547 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:27,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:05:27,547 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 32041234, now seen corresponding path program 1 times [2022-04-15 12:05:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6884644] [2022-04-15 12:05:27,577 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:27,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash 32041234, now seen corresponding path program 2 times [2022-04-15 12:05:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189341105] [2022-04-15 12:05:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:27,701 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-15 12:05:27,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-15 12:05:27,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-15 12:05:27,702 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-15 12:05:27,702 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-15 12:05:27,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-15 12:05:27,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-15 12:05:27,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret17 := main(); {597#true} is VALID [2022-04-15 12:05:27,707 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-15 12:05:27,707 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-15 12:05:27,708 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-15 12:05:27,709 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-15 12:05:27,709 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-15 12:05:27,709 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-15 12:05:27,710 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-15 12:05:27,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#false} assume !(0 != #t~mem4);havoc #t~mem4; {598#false} is VALID [2022-04-15 12:05:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {598#false} ~cont~0 := 0;~i~0 := 0; {598#false} is VALID [2022-04-15 12:05:27,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {598#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {598#false} is VALID [2022-04-15 12:05:27,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {598#false} ~i~0 := 0;~cont_aux~0 := 0; {598#false} is VALID [2022-04-15 12:05:27,711 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-15 12:05:27,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {598#false} assume !(0 != #t~mem11);havoc #t~mem11; {598#false} is VALID [2022-04-15 12:05:27,711 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-15 12:05:27,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2022-04-15 12:05:27,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {598#false} assume 0 == ~cond; {598#false} is VALID [2022-04-15 12:05:27,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-15 12:05:27,712 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-15 12:05:27,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:27,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189341105] [2022-04-15 12:05:27,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189341105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:27,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182406185] [2022-04-15 12:05:27,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:27,719 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-15 12:05:27,727 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-15 12:05:27,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:05:27,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:05:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:27,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:27,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2022-04-15 12:05:27,974 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-15 12:05:27,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-15 12:05:27,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #133#return; {597#true} is VALID [2022-04-15 12:05:27,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret17 := main(); {597#true} is VALID [2022-04-15 12:05:27,975 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-15 12:05:27,975 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-15 12:05:27,975 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-15 12:05:27,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} assume !(~i~0 % 4294967296 < 5); {597#true} is VALID [2022-04-15 12:05:27,976 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-15 12:05:27,976 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-15 12:05:27,976 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-15 12:05:27,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#true} assume !(0 != #t~mem4);havoc #t~mem4; {597#true} is VALID [2022-04-15 12:05:27,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#true} ~cont~0 := 0;~i~0 := 0; {647#(= main_~cont~0 0)} is VALID [2022-04-15 12:05:27,977 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-15 12:05:27,978 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-15 12:05:27,979 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-15 12:05:27,979 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-15 12:05:27,980 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-15 12:05:27,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:05:27,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {598#false} is VALID [2022-04-15 12:05:27,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-15 12:05:27,982 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-15 12:05:27,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:05:27,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182406185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:27,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:05:27,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-15 12:05:27,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:27,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6884644] [2022-04-15 12:05:27,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6884644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:27,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:27,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:05:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670073843] [2022-04-15 12:05:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:27,985 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-15 12:05:27,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:27,985 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-15 12:05:28,005 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-15 12:05:28,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:05:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:05:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:05:28,007 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-15 12:05:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:28,191 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 12:05:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:05:28,192 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-15 12:05:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:28,192 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-15 12:05:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 12:05:28,194 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-15 12:05:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 12:05:28,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-15 12:05:28,255 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-15 12:05:28,257 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:05:28,257 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:05:28,257 INFO L912 BasicCegarLoop]: 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-15 12:05:28,258 INFO L913 BasicCegarLoop]: 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-15 12:05:28,259 INFO L914 BasicCegarLoop]: 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-15 12:05:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:05:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2022-04-15 12:05:28,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:28,265 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-15 12:05:28,265 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-15 12:05:28,266 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-15 12:05:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:28,268 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 12:05:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-15 12:05:28,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:28,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:28,269 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-15 12:05:28,269 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-15 12:05:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:28,271 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 12:05:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-04-15 12:05:28,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:28,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:28,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:28,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:28,271 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-15 12:05:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-04-15 12:05:28,273 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 22 [2022-04-15 12:05:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:28,273 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-04-15 12:05:28,273 INFO L479 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-15 12:05:28,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 55 transitions. [2022-04-15 12:05:28,337 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-15 12:05:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-04-15 12:05:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:05:28,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:28,338 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:28,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 12:05:28,562 WARN L460 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-15 12:05:28,563 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1521854123, now seen corresponding path program 1 times [2022-04-15 12:05:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:28,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738159705] [2022-04-15 12:05:28,581 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:28,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1521854123, now seen corresponding path program 2 times [2022-04-15 12:05:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286701810] [2022-04-15 12:05:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:28,690 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-15 12:05:28,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 12:05:28,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-15 12:05:28,691 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-15 12:05:28,691 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-15 12:05:28,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 12:05:28,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-15 12:05:28,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret17 := main(); {972#true} is VALID [2022-04-15 12:05:28,692 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-15 12:05:28,693 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-15 12:05:28,693 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-15 12:05:28,694 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-15 12:05:28,694 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-15 12:05:28,694 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-15 12:05:28,694 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-15 12:05:28,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {973#false} assume !(0 != #t~mem4);havoc #t~mem4; {973#false} is VALID [2022-04-15 12:05:28,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {973#false} ~cont~0 := 0;~i~0 := 0; {973#false} is VALID [2022-04-15 12:05:28,695 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-15 12:05:28,695 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-15 12:05:28,695 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-15 12:05:28,695 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-15 12:05:28,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {973#false} assume !(~j~0 % 4294967296 < 2); {973#false} is VALID [2022-04-15 12:05:28,696 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-15 12:05:28,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {973#false} is VALID [2022-04-15 12:05:28,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#false} ~i~0 := 0;~cont_aux~0 := 0; {973#false} is VALID [2022-04-15 12:05:28,696 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-15 12:05:28,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {973#false} assume !(0 != #t~mem11);havoc #t~mem11; {973#false} is VALID [2022-04-15 12:05:28,696 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-15 12:05:28,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2022-04-15 12:05:28,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {973#false} assume 0 == ~cond; {973#false} is VALID [2022-04-15 12:05:28,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-15 12:05:28,697 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-15 12:05:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286701810] [2022-04-15 12:05:28,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286701810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500722010] [2022-04-15 12:05:28,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:28,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:28,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:28,699 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-15 12:05:28,701 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-15 12:05:28,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:28,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:28,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:05:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:28,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:28,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2022-04-15 12:05:28,890 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-15 12:05:28,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-15 12:05:28,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #133#return; {972#true} is VALID [2022-04-15 12:05:28,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret17 := main(); {972#true} is VALID [2022-04-15 12:05:28,891 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-15 12:05:28,891 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-15 12:05:28,891 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-15 12:05:28,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(~i~0 % 4294967296 < 5); {972#true} is VALID [2022-04-15 12:05:28,891 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-15 12:05:28,892 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-15 12:05:28,892 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-15 12:05:28,892 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-15 12:05:28,893 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-15 12:05:28,893 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-15 12:05:28,894 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-15 12:05:28,894 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-15 12:05:28,894 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-15 12:05:28,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {973#false} assume !(~j~0 % 4294967296 < 2); {973#false} is VALID [2022-04-15 12:05:28,894 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-15 12:05:28,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {973#false} is VALID [2022-04-15 12:05:28,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#false} ~i~0 := 0;~cont_aux~0 := 0; {973#false} is VALID [2022-04-15 12:05:28,895 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-15 12:05:28,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {973#false} assume !(0 != #t~mem11);havoc #t~mem11; {973#false} is VALID [2022-04-15 12:05:28,895 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-15 12:05:28,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2022-04-15 12:05:28,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {973#false} assume 0 == ~cond; {973#false} is VALID [2022-04-15 12:05:28,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-15 12:05:28,896 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-15 12:05:28,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:05:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500722010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:28,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:05:28,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-04-15 12:05:28,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [738159705] [2022-04-15 12:05:28,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [738159705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:28,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:28,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:05:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89515649] [2022-04-15 12:05:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:28,898 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-15 12:05:28,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:28,898 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-15 12:05:28,919 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-15 12:05:28,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:05:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:05:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:05:28,921 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-15 12:05:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:29,031 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2022-04-15 12:05:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:05:29,031 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-15 12:05:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:29,031 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-15 12:05:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-15 12:05:29,033 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-15 12:05:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-15 12:05:29,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-15 12:05:29,108 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-15 12:05:29,110 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:05:29,110 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:05:29,111 INFO L912 BasicCegarLoop]: 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-15 12:05:29,112 INFO L913 BasicCegarLoop]: 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-15 12:05:29,112 INFO L914 BasicCegarLoop]: 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-15 12:05:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:05:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2022-04-15 12:05:29,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:29,120 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-15 12:05:29,120 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-15 12:05:29,121 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-15 12:05:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:29,123 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-15 12:05:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-15 12:05:29,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:29,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:29,124 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-15 12:05:29,124 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-15 12:05:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:29,126 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-15 12:05:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-15 12:05:29,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:29,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:29,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:29,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:29,144 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-15 12:05:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2022-04-15 12:05:29,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 28 [2022-04-15 12:05:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:29,146 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2022-04-15 12:05:29,146 INFO L479 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-15 12:05:29,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 60 transitions. [2022-04-15 12:05:29,391 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-15 12:05:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2022-04-15 12:05:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:05:29,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:29,392 INFO L499 BasicCegarLoop]: 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-15 12:05:29,419 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-15 12:05:29,592 WARN L460 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-15 12:05:29,593 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2104041838, now seen corresponding path program 1 times [2022-04-15 12:05:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:29,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417014469] [2022-04-15 12:05:29,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:29,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2104041838, now seen corresponding path program 2 times [2022-04-15 12:05:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995562276] [2022-04-15 12:05:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:29,700 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-15 12:05:29,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-15 12:05:29,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-15 12:05:29,702 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-15 12:05:29,702 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-15 12:05:29,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-15 12:05:29,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-15 12:05:29,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-15 12:05:29,703 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-15 12:05:29,704 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-15 12:05:29,704 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-15 12:05:29,705 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-15 12:05:29,705 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-15 12:05:29,705 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-15 12:05:29,705 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-15 12:05:29,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {1502#false} assume !(0 != #t~mem4);havoc #t~mem4; {1502#false} is VALID [2022-04-15 12:05:29,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {1502#false} ~cont~0 := 0;~i~0 := 0; {1502#false} is VALID [2022-04-15 12:05:29,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {1502#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1502#false} is VALID [2022-04-15 12:05:29,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {1502#false} ~i~0 := 0;~cont_aux~0 := 0; {1502#false} is VALID [2022-04-15 12:05:29,706 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-15 12:05:29,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {1502#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1502#false} is VALID [2022-04-15 12:05:29,706 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-15 12:05:29,706 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-15 12:05:29,707 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-15 12:05:29,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-15 12:05:29,707 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-15 12:05:29,707 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-15 12:05:29,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-15 12:05:29,707 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-15 12:05:29,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-15 12:05:29,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-15 12:05:29,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-15 12:05:29,708 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-15 12:05:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995562276] [2022-04-15 12:05:29,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995562276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530562686] [2022-04-15 12:05:29,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:29,710 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-15 12:05:29,722 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-15 12:05:29,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:29,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:05:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:29,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:29,872 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-15 12:05:30,000 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-15 12:05:30,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2022-04-15 12:05:30,036 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-15 12:05:30,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-15 12:05:30,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-15 12:05:30,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-15 12:05:30,040 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-15 12:05:30,043 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-15 12:05:30,044 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-15 12:05:30,044 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-15 12:05:30,044 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-15 12:05:30,045 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-15 12:05:30,046 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-15 12:05:30,046 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-15 12:05:30,047 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-15 12:05:30,047 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-15 12:05:30,048 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-15 12:05:30,048 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-15 12:05:30,049 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-15 12:05:30,049 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-15 12:05:30,049 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-15 12:05:30,049 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-15 12:05:30,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-15 12:05:30,049 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-15 12:05:30,050 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-15 12:05:30,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-15 12:05:30,050 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-15 12:05:30,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-15 12:05:30,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-15 12:05:30,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-15 12:05:30,051 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-15 12:05:30,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:30,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-15 12:05:30,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {1502#false} assume 0 == ~cond; {1502#false} is VALID [2022-04-15 12:05:30,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {1502#false} ~cond := #in~cond; {1502#false} is VALID [2022-04-15 12:05:30,213 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-15 12:05:30,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {1502#false} assume !(0 != #t~mem11);havoc #t~mem11; {1502#false} is VALID [2022-04-15 12:05:30,213 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-15 12:05:30,213 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-15 12:05:30,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {1502#false} assume !(~j~0 % 4294967296 < 2); {1502#false} is VALID [2022-04-15 12:05:30,214 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-15 12:05:30,214 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-15 12:05:30,215 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-15 12:05:30,215 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-15 12:05:30,216 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-15 12:05:30,216 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-15 12:05:30,217 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-15 12:05:30,217 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-15 12:05:30,218 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-15 12:05:30,219 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-15 12:05:30,219 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-15 12:05:30,219 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-15 12:05:30,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#true} assume !(~i~0 % 4294967296 < 5); {1501#true} is VALID [2022-04-15 12:05:30,220 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-15 12:05:30,220 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-15 12:05:30,220 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-15 12:05:30,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret17 := main(); {1501#true} is VALID [2022-04-15 12:05:30,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #133#return; {1501#true} is VALID [2022-04-15 12:05:30,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-15 12:05:30,221 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-15 12:05:30,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2022-04-15 12:05:30,222 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-15 12:05:30,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530562686] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:30,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:05:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-15 12:05:30,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417014469] [2022-04-15 12:05:30,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417014469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:30,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:05:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023884069] [2022-04-15 12:05:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:30,224 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-15 12:05:30,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:30,224 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-15 12:05:30,256 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-15 12:05:30,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:05:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:05:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:05:30,258 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-15 12:05:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:30,511 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-15 12:05:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:05:30,512 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-15 12:05:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:30,512 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-15 12:05:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 12:05:30,513 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-15 12:05:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 12:05:30,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-15 12:05:30,560 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-15 12:05:30,561 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:05:30,561 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:05:30,561 INFO L912 BasicCegarLoop]: 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-15 12:05:30,562 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:30,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:05:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:05:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:05:30,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:30,569 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-15 12:05:30,569 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-15 12:05:30,569 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-15 12:05:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:30,571 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-15 12:05:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-15 12:05:30,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:30,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:30,577 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-15 12:05:30,577 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-15 12:05:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:30,578 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-04-15 12:05:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-15 12:05:30,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:30,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:30,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:30,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:30,579 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-15 12:05:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-04-15 12:05:30,580 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 29 [2022-04-15 12:05:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:30,581 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-04-15 12:05:30,581 INFO L479 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-15 12:05:30,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 57 transitions. [2022-04-15 12:05:30,637 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-15 12:05:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-04-15 12:05:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:05:30,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:30,638 INFO L499 BasicCegarLoop]: 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-15 12:05:30,662 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-15 12:05:30,859 WARN L460 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-15 12:05:30,860 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 130872262, now seen corresponding path program 1 times [2022-04-15 12:05:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:30,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769174311] [2022-04-15 12:05:30,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:30,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 130872262, now seen corresponding path program 2 times [2022-04-15 12:05:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:30,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985941769] [2022-04-15 12:05:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:30,942 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-15 12:05:30,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-15 12:05:30,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-15 12:05:30,943 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-15 12:05:30,943 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-15 12:05:30,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-15 12:05:30,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-15 12:05:30,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-15 12:05:30,945 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-15 12:05:30,947 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-15 12:05:30,949 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-15 12:05:30,955 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-15 12:05:30,956 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-15 12:05:30,956 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-15 12:05:30,957 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-15 12:05:30,957 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-15 12:05:30,957 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-15 12:05:30,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {2014#false} assume !(0 != #t~mem4);havoc #t~mem4; {2014#false} is VALID [2022-04-15 12:05:30,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {2014#false} ~cont~0 := 0;~i~0 := 0; {2014#false} is VALID [2022-04-15 12:05:30,957 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-15 12:05:30,957 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-15 12:05:30,958 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-15 12:05:30,958 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-15 12:05:30,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2014#false} assume !(~j~0 % 4294967296 < 2); {2014#false} is VALID [2022-04-15 12:05:30,958 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-15 12:05:30,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {2014#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2014#false} is VALID [2022-04-15 12:05:30,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {2014#false} ~i~0 := 0;~cont_aux~0 := 0; {2014#false} is VALID [2022-04-15 12:05:30,958 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-15 12:05:30,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {2014#false} assume !(0 != #t~mem11);havoc #t~mem11; {2014#false} is VALID [2022-04-15 12:05:30,959 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-15 12:05:30,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-15 12:05:30,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-15 12:05:30,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-15 12:05:30,959 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-15 12:05:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985941769] [2022-04-15 12:05:30,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985941769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905253067] [2022-04-15 12:05:30,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:30,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:30,961 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-15 12:05:30,962 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-15 12:05:31,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:31,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:31,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:05:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:31,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:31,089 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-15 12:05:31,295 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-15 12:05:31,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {2013#true} call ULTIMATE.init(); {2013#true} is VALID [2022-04-15 12:05:31,316 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-15 12:05:31,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-15 12:05:31,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-15 12:05:31,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-15 12:05:31,317 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-15 12:05:31,318 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-15 12:05:31,318 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-15 12:05:31,318 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-15 12:05:31,319 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-15 12:05:31,319 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-15 12:05:31,320 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-15 12:05:31,320 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-15 12:05:31,321 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-15 12:05:31,321 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-15 12:05:31,322 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-15 12:05:31,322 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-15 12:05:31,323 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-15 12:05:31,323 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-15 12:05:31,324 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-15 12:05:31,324 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-15 12:05:31,325 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-15 12:05:31,325 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-15 12:05:31,326 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-15 12:05:31,326 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-15 12:05:31,327 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-15 12:05:31,327 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-15 12:05:31,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-15 12:05:31,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-15 12:05:31,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-15 12:05:31,328 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-15 12:05:31,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:31,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {2014#false} assume !false; {2014#false} is VALID [2022-04-15 12:05:31,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {2014#false} assume 0 == ~cond; {2014#false} is VALID [2022-04-15 12:05:31,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#false} ~cond := #in~cond; {2014#false} is VALID [2022-04-15 12:05:31,494 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-15 12:05:31,495 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-15 12:05:31,496 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-15 12:05:31,498 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-15 12:05:31,499 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-15 12:05:31,499 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-15 12:05:31,499 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-15 12:05:31,500 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-15 12:05:31,500 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-15 12:05:31,500 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-15 12:05:31,501 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-15 12:05:31,501 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-15 12:05:31,501 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-15 12:05:31,502 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-15 12:05:31,502 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-15 12:05:31,503 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-15 12:05:31,503 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-15 12:05:31,503 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-15 12:05:31,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {2013#true} assume !(~i~0 % 4294967296 < 5); {2013#true} is VALID [2022-04-15 12:05:31,504 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-15 12:05:31,504 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-15 12:05:31,504 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-15 12:05:31,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2013#true} call #t~ret17 := main(); {2013#true} is VALID [2022-04-15 12:05:31,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2013#true} {2013#true} #133#return; {2013#true} is VALID [2022-04-15 12:05:31,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume true; {2013#true} is VALID [2022-04-15 12:05:31,504 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-15 12:05:31,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {2013#true} call ULTIMATE.init(); {2013#true} is VALID [2022-04-15 12:05:31,505 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-15 12:05:31,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905253067] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:31,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:05:31,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-04-15 12:05:31,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:31,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769174311] [2022-04-15 12:05:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769174311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:05:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502307630] [2022-04-15 12:05:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:31,506 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-15 12:05:31,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:31,507 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-15 12:05:31,528 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-15 12:05:31,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:05:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:05:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:05:31,529 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-15 12:05:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:31,793 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-04-15 12:05:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:05:31,793 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-15 12:05:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:31,794 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-15 12:05:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:05:31,795 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-15 12:05:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:05:31,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 12:05:31,847 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-15 12:05:31,849 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:05:31,849 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:05:31,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:05:31,850 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:31,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 104 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:05:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:05:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-15 12:05:31,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:31,860 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-15 12:05:31,860 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-15 12:05:31,860 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-15 12:05:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:31,862 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-15 12:05:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-15 12:05:31,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:31,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:31,863 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-15 12:05:31,863 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-15 12:05:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:31,865 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-04-15 12:05:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-04-15 12:05:31,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:31,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:31,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:31,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:31,866 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-15 12:05:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-04-15 12:05:31,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2022-04-15 12:05:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:31,868 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-04-15 12:05:31,868 INFO L479 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-15 12:05:31,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2022-04-15 12:05:31,936 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-15 12:05:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-15 12:05:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:05:31,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:31,937 INFO L499 BasicCegarLoop]: 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-15 12:05:31,958 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-15 12:05:32,143 WARN L460 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-15 12:05:32,143 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1933277107, now seen corresponding path program 1 times [2022-04-15 12:05:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:32,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221489957] [2022-04-15 12:05:32,161 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:32,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1933277107, now seen corresponding path program 2 times [2022-04-15 12:05:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55501174] [2022-04-15 12:05:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:32,227 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-15 12:05:32,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 12:05:32,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-15 12:05:32,230 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-15 12:05:32,230 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-15 12:05:32,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 12:05:32,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-15 12:05:32,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-15 12:05:32,231 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-15 12:05:32,231 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-15 12:05:32,232 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-15 12:05:32,232 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-15 12:05:32,233 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-15 12:05:32,233 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-15 12:05:32,233 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-15 12:05:32,233 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-15 12:05:32,233 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-15 12:05:32,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !(0 != #t~mem4);havoc #t~mem4; {2590#false} is VALID [2022-04-15 12:05:32,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} ~cont~0 := 0;~i~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2590#false} is VALID [2022-04-15 12:05:32,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,234 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-15 12:05:32,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,234 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-15 12:05:32,234 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-15 12:05:32,234 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-15 12:05:32,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-15 12:05:32,234 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-15 12:05:32,235 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-15 12:05:32,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-15 12:05:32,235 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-15 12:05:32,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-15 12:05:32,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-15 12:05:32,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 12:05:32,235 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-15 12:05:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:32,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55501174] [2022-04-15 12:05:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55501174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:32,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452199820] [2022-04-15 12:05:32,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:32,237 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-15 12:05:32,264 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-15 12:05:32,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:32,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:32,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:05:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:32,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:32,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-15 12:05:32,383 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-15 12:05:32,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 12:05:32,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-15 12:05:32,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-15 12:05:32,384 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-15 12:05:32,384 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-15 12:05:32,385 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-15 12:05:32,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {2621#(= main_~i~0 1)} assume !(~i~0 % 4294967296 < 5); {2590#false} is VALID [2022-04-15 12:05:32,385 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-15 12:05:32,386 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-15 12:05:32,386 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-15 12:05:32,386 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-15 12:05:32,386 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-15 12:05:32,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !(0 != #t~mem4);havoc #t~mem4; {2590#false} is VALID [2022-04-15 12:05:32,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} ~cont~0 := 0;~i~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2590#false} is VALID [2022-04-15 12:05:32,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,387 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-15 12:05:32,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,387 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-15 12:05:32,387 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-15 12:05:32,387 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-15 12:05:32,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-15 12:05:32,387 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-15 12:05:32,387 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-15 12:05:32,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-15 12:05:32,388 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-15 12:05:32,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-15 12:05:32,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-15 12:05:32,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 12:05:32,388 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-15 12:05:32,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:32,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 12:05:32,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-15 12:05:32,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-15 12:05:32,513 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-15 12:05:32,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} assume !(0 != #t~mem11);havoc #t~mem11; {2590#false} is VALID [2022-04-15 12:05:32,513 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-15 12:05:32,514 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-15 12:05:32,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} assume !(~j~0 % 4294967296 < 2); {2590#false} is VALID [2022-04-15 12:05:32,514 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-15 12:05:32,514 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-15 12:05:32,514 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-15 12:05:32,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,514 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-15 12:05:32,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} ~i~0 := 0;~cont_aux~0 := 0; {2590#false} is VALID [2022-04-15 12:05:32,515 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-15 12:05:32,515 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-15 12:05:32,516 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-15 12:05:32,516 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-15 12:05:32,517 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-15 12:05:32,517 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-15 12:05:32,517 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-15 12:05:32,517 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-15 12:05:32,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume !(~i~0 % 4294967296 < 5); {2589#true} is VALID [2022-04-15 12:05:32,518 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-15 12:05:32,518 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-15 12:05:32,518 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-15 12:05:32,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret17 := main(); {2589#true} is VALID [2022-04-15 12:05:32,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #133#return; {2589#true} is VALID [2022-04-15 12:05:32,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 12:05:32,518 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-15 12:05:32,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-15 12:05:32,519 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-15 12:05:32,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452199820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:32,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:32,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-04-15 12:05:32,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221489957] [2022-04-15 12:05:32,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221489957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:32,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:32,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:05:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520793938] [2022-04-15 12:05:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:32,521 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-15 12:05:32,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:32,521 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-15 12:05:32,546 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-15 12:05:32,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:05:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:05:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:05:32,548 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-15 12:05:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:32,806 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2022-04-15 12:05:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:05:32,806 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-15 12:05:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:32,807 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-15 12:05:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-04-15 12:05:32,809 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-15 12:05:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-04-15 12:05:32,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 106 transitions. [2022-04-15 12:05:32,905 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-15 12:05:32,908 INFO L225 Difference]: With dead ends: 133 [2022-04-15 12:05:32,908 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 12:05:32,908 INFO L912 BasicCegarLoop]: 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-15 12:05:32,909 INFO L913 BasicCegarLoop]: 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-15 12:05:32,932 INFO L914 BasicCegarLoop]: 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-15 12:05:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 12:05:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 49. [2022-04-15 12:05:32,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:32,988 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-15 12:05:32,988 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-15 12:05:32,988 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-15 12:05:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:32,992 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-04-15 12:05:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-04-15 12:05:32,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:32,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:32,992 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-15 12:05:32,993 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-15 12:05:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:32,995 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-04-15 12:05:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-04-15 12:05:32,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:32,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:32,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:32,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:32,996 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-15 12:05:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-04-15 12:05:32,998 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 31 [2022-04-15 12:05:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:32,998 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-04-15 12:05:32,998 INFO L479 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-15 12:05:32,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 61 transitions. [2022-04-15 12:05:33,085 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-15 12:05:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-04-15 12:05:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:05:33,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:33,086 INFO L499 BasicCegarLoop]: 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-15 12:05:33,132 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-15 12:05:33,299 WARN L460 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-15 12:05:33,299 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1557440111, now seen corresponding path program 3 times [2022-04-15 12:05:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:33,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635191351] [2022-04-15 12:05:33,305 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:33,305 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1557440111, now seen corresponding path program 4 times [2022-04-15 12:05:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:33,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337817523] [2022-04-15 12:05:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:33,397 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-15 12:05:33,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-15 12:05:33,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-15 12:05:33,398 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-15 12:05:33,398 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-15 12:05:33,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-15 12:05:33,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-15 12:05:33,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-15 12:05:33,399 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-15 12:05:33,399 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-15 12:05:33,400 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-15 12:05:33,400 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-15 12:05:33,401 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-15 12:05:33,401 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-15 12:05:33,401 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-15 12:05:33,401 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-15 12:05:33,402 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-15 12:05:33,402 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-15 12:05:33,402 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-15 12:05:33,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {3345#false} assume !(0 != #t~mem4);havoc #t~mem4; {3345#false} is VALID [2022-04-15 12:05:33,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {3345#false} ~cont~0 := 0;~i~0 := 0; {3345#false} is VALID [2022-04-15 12:05:33,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {3345#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3345#false} is VALID [2022-04-15 12:05:33,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#false} ~i~0 := 0;~cont_aux~0 := 0; {3345#false} is VALID [2022-04-15 12:05:33,402 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-15 12:05:33,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3345#false} is VALID [2022-04-15 12:05:33,403 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-15 12:05:33,403 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-15 12:05:33,403 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-15 12:05:33,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {3345#false} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-15 12:05:33,403 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-15 12:05:33,403 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-15 12:05:33,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-15 12:05:33,403 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-15 12:05:33,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-15 12:05:33,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-15 12:05:33,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-15 12:05:33,404 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-15 12:05:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:33,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337817523] [2022-04-15 12:05:33,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337817523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:33,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347656023] [2022-04-15 12:05:33,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:05:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:33,406 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-15 12:05:33,435 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-15 12:05:33,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:05:33,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:33,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:05:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:33,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:33,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {3344#true} call ULTIMATE.init(); {3344#true} is VALID [2022-04-15 12:05:33,593 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-15 12:05:33,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-15 12:05:33,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-15 12:05:33,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-15 12:05:33,595 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-15 12:05:33,608 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-15 12:05:33,608 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-15 12:05:33,609 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-15 12:05:33,609 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-15 12:05:33,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < 5); {3344#true} is VALID [2022-04-15 12:05:33,609 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-15 12:05:33,609 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-15 12:05:33,610 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-15 12:05:33,610 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-15 12:05:33,610 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-15 12:05:33,611 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-15 12:05:33,611 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-15 12:05:33,612 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-15 12:05:33,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#false} ~i~0 := 0;~cont_aux~0 := 0; {3345#false} is VALID [2022-04-15 12:05:33,612 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-15 12:05:33,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3345#false} is VALID [2022-04-15 12:05:33,612 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-15 12:05:33,612 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-15 12:05:33,612 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-15 12:05:33,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {3345#false} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-15 12:05:33,612 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-15 12:05:33,613 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-15 12:05:33,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-15 12:05:33,613 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-15 12:05:33,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-15 12:05:33,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-15 12:05:33,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-15 12:05:33,613 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-15 12:05:33,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:33,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {3345#false} assume !false; {3345#false} is VALID [2022-04-15 12:05:33,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {3345#false} assume 0 == ~cond; {3345#false} is VALID [2022-04-15 12:05:33,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {3345#false} ~cond := #in~cond; {3345#false} is VALID [2022-04-15 12:05:33,727 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-15 12:05:33,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {3345#false} assume !(0 != #t~mem11);havoc #t~mem11; {3345#false} is VALID [2022-04-15 12:05:33,727 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-15 12:05:33,728 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-15 12:05:33,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {3476#(< (mod main_~j~0 4294967296) 2)} assume !(~j~0 % 4294967296 < 2); {3345#false} is VALID [2022-04-15 12:05:33,732 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-15 12:05:33,733 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-15 12:05:33,733 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-15 12:05:33,734 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-15 12:05:33,734 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-15 12:05:33,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {3344#true} ~i~0 := 0;~cont_aux~0 := 0; {3344#true} is VALID [2022-04-15 12:05:33,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3344#true} is VALID [2022-04-15 12:05:33,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {3344#true} ~cont~0 := 0;~i~0 := 0; {3344#true} is VALID [2022-04-15 12:05:33,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {3344#true} assume !(0 != #t~mem4);havoc #t~mem4; {3344#true} is VALID [2022-04-15 12:05:33,734 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {3344#true} assume !(~i~0 % 4294967296 < 5); {3344#true} is VALID [2022-04-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,735 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-15 12:05:33,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {3344#true} call #t~ret17 := main(); {3344#true} is VALID [2022-04-15 12:05:33,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3344#true} {3344#true} #133#return; {3344#true} is VALID [2022-04-15 12:05:33,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3344#true} assume true; {3344#true} is VALID [2022-04-15 12:05:33,736 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-15 12:05:33,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {3344#true} call ULTIMATE.init(); {3344#true} is VALID [2022-04-15 12:05:33,736 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-15 12:05:33,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347656023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:33,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:33,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 12 [2022-04-15 12:05:33,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:33,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635191351] [2022-04-15 12:05:33,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635191351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:33,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:33,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:05:33,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358655153] [2022-04-15 12:05:33,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:33,738 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-15 12:05:33,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:33,738 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-15 12:05:33,763 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-15 12:05:33,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:05:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:05:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:05:33,764 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-15 12:05:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:34,254 INFO L93 Difference]: Finished difference Result 160 states and 215 transitions. [2022-04-15 12:05:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:05:34,255 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-15 12:05:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:34,255 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-15 12:05:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-04-15 12:05:34,257 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-15 12:05:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-04-15 12:05:34,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2022-04-15 12:05:34,378 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-15 12:05:34,381 INFO L225 Difference]: With dead ends: 160 [2022-04-15 12:05:34,381 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 12:05:34,381 INFO L912 BasicCegarLoop]: 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-15 12:05:34,382 INFO L913 BasicCegarLoop]: 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-15 12:05:34,382 INFO L914 BasicCegarLoop]: 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-15 12:05:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 12:05:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 51. [2022-04-15 12:05:34,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:34,477 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-15 12:05:34,477 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-15 12:05:34,478 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-15 12:05:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:34,482 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-04-15 12:05:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2022-04-15 12:05:34,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:34,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:34,483 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-15 12:05:34,483 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-15 12:05:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:34,487 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2022-04-15 12:05:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2022-04-15 12:05:34,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:34,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:34,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:34,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:34,488 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-15 12:05:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-15 12:05:34,489 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 33 [2022-04-15 12:05:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:34,490 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-15 12:05:34,490 INFO L479 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-15 12:05:34,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-15 12:05:34,584 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-15 12:05:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 12:05:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:05:34,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:34,585 INFO L499 BasicCegarLoop]: 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-15 12:05:34,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:05:34,799 WARN L460 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-15 12:05:34,799 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1767228433, now seen corresponding path program 5 times [2022-04-15 12:05:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2067578398] [2022-04-15 12:05:34,805 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:34,805 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1767228433, now seen corresponding path program 6 times [2022-04-15 12:05:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:34,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674163942] [2022-04-15 12:05:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:34,889 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-15 12:05:34,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-15 12:05:34,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-15 12:05:34,890 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-15 12:05:34,890 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-15 12:05:34,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-15 12:05:34,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-15 12:05:34,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-15 12:05:34,891 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-15 12:05:34,891 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-15 12:05:34,891 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-15 12:05:34,892 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-15 12:05:34,893 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-15 12:05:34,893 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-15 12:05:34,894 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-15 12:05:34,894 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-15 12:05:34,895 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-15 12:05:34,895 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-15 12:05:34,895 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-15 12:05:34,895 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-15 12:05:34,895 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-15 12:05:34,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {4229#false} assume !(0 != #t~mem4);havoc #t~mem4; {4229#false} is VALID [2022-04-15 12:05:34,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {4229#false} ~cont~0 := 0;~i~0 := 0; {4229#false} is VALID [2022-04-15 12:05:34,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {4229#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4229#false} is VALID [2022-04-15 12:05:34,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-15 12:05:34,896 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-15 12:05:34,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-15 12:05:34,896 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-15 12:05:34,896 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-15 12:05:34,896 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-15 12:05:34,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-15 12:05:34,897 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-15 12:05:34,897 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-15 12:05:34,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-15 12:05:34,897 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-15 12:05:34,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-15 12:05:34,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-15 12:05:34,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-15 12:05:34,898 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-15 12:05:34,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:34,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674163942] [2022-04-15 12:05:34,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674163942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:34,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221582734] [2022-04-15 12:05:34,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:05:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:34,900 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-15 12:05:34,905 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-15 12:05:34,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:05:34,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:34,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:05:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:34,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:35,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} call ULTIMATE.init(); {4228#true} is VALID [2022-04-15 12:05:35,081 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-15 12:05:35,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-15 12:05:35,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-15 12:05:35,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-15 12:05:35,082 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-15 12:05:35,082 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-15 12:05:35,082 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-15 12:05:35,082 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-15 12:05:35,082 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-15 12:05:35,082 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-15 12:05:35,083 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-15 12:05:35,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {4228#true} assume !(~i~0 % 4294967296 < 5); {4228#true} is VALID [2022-04-15 12:05:35,083 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-15 12:05:35,083 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-15 12:05:35,083 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-15 12:05:35,084 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-15 12:05:35,084 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-15 12:05:35,084 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-15 12:05:35,085 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-15 12:05:35,085 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-15 12:05:35,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-15 12:05:35,086 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-15 12:05:35,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-15 12:05:35,086 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-15 12:05:35,086 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-15 12:05:35,086 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-15 12:05:35,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-15 12:05:35,086 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-15 12:05:35,086 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-15 12:05:35,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-15 12:05:35,087 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-15 12:05:35,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-15 12:05:35,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-15 12:05:35,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-15 12:05:35,087 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-15 12:05:35,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:35,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-04-15 12:05:35,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {4229#false} assume 0 == ~cond; {4229#false} is VALID [2022-04-15 12:05:35,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {4229#false} ~cond := #in~cond; {4229#false} is VALID [2022-04-15 12:05:35,202 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-15 12:05:35,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#false} assume !(0 != #t~mem11);havoc #t~mem11; {4229#false} is VALID [2022-04-15 12:05:35,202 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-15 12:05:35,202 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-15 12:05:35,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {4229#false} assume !(~j~0 % 4294967296 < 2); {4229#false} is VALID [2022-04-15 12:05:35,202 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-15 12:05:35,202 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-15 12:05:35,202 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-15 12:05:35,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {4229#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4229#false} is VALID [2022-04-15 12:05:35,202 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-15 12:05:35,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {4229#false} ~i~0 := 0;~cont_aux~0 := 0; {4229#false} is VALID [2022-04-15 12:05:35,203 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-15 12:05:35,203 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-15 12:05:35,203 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-15 12:05:35,204 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-15 12:05:35,204 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-15 12:05:35,205 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-15 12:05:35,205 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-15 12:05:35,205 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-15 12:05:35,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {4228#true} assume !(~i~0 % 4294967296 < 5); {4228#true} is VALID [2022-04-15 12:05:35,205 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-15 12:05:35,205 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-15 12:05:35,205 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-15 12:05:35,206 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-15 12:05:35,206 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-15 12:05:35,206 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-15 12:05:35,206 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-15 12:05:35,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {4228#true} call #t~ret17 := main(); {4228#true} is VALID [2022-04-15 12:05:35,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4228#true} {4228#true} #133#return; {4228#true} is VALID [2022-04-15 12:05:35,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4228#true} assume true; {4228#true} is VALID [2022-04-15 12:05:35,206 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-15 12:05:35,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {4228#true} call ULTIMATE.init(); {4228#true} is VALID [2022-04-15 12:05:35,206 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-15 12:05:35,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221582734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:35,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:35,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 13 [2022-04-15 12:05:35,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2067578398] [2022-04-15 12:05:35,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2067578398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:35,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:35,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:05:35,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448120111] [2022-04-15 12:05:35,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:35,208 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-15 12:05:35,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:35,208 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-15 12:05:35,236 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-15 12:05:35,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:05:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:05:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:05:35,238 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-15 12:05:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:36,134 INFO L93 Difference]: Finished difference Result 187 states and 253 transitions. [2022-04-15 12:05:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:05:36,134 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-15 12:05:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:36,141 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-15 12:05:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 12:05:36,151 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-15 12:05:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-04-15 12:05:36,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 148 transitions. [2022-04-15 12:05:36,307 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-15 12:05:36,310 INFO L225 Difference]: With dead ends: 187 [2022-04-15 12:05:36,310 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 12:05:36,311 INFO L912 BasicCegarLoop]: 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-15 12:05:36,311 INFO L913 BasicCegarLoop]: 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-15 12:05:36,311 INFO L914 BasicCegarLoop]: 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-15 12:05:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 12:05:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 53. [2022-04-15 12:05:36,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:36,410 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-15 12:05:36,410 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-15 12:05:36,412 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-15 12:05:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:36,417 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-15 12:05:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-15 12:05:36,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:36,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:36,418 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-15 12:05:36,418 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-15 12:05:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:36,425 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-15 12:05:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-15 12:05:36,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:36,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:36,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:36,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:36,426 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-15 12:05:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-04-15 12:05:36,428 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 35 [2022-04-15 12:05:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:36,428 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-04-15 12:05:36,428 INFO L479 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-15 12:05:36,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 65 transitions. [2022-04-15 12:05:36,521 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-15 12:05:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-04-15 12:05:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:05:36,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:36,522 INFO L499 BasicCegarLoop]: 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-15 12:05:36,548 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-15 12:05:36,731 WARN L460 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-15 12:05:36,732 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1510342963, now seen corresponding path program 7 times [2022-04-15 12:05:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688177703] [2022-04-15 12:05:36,737 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:36,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1510342963, now seen corresponding path program 8 times [2022-04-15 12:05:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:36,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137959519] [2022-04-15 12:05:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:36,859 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-15 12:05:36,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-15 12:05:36,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-15 12:05:36,860 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-15 12:05:36,860 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-15 12:05:36,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-15 12:05:36,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-15 12:05:36,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-15 12:05:36,860 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-15 12:05:36,861 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-15 12:05:36,861 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-15 12:05:36,862 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-15 12:05:36,862 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-15 12:05:36,863 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-15 12:05:36,863 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-15 12:05:36,864 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-15 12:05:36,864 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-15 12:05:36,865 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-15 12:05:36,865 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-15 12:05:36,865 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-15 12:05:36,865 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-15 12:05:36,865 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-15 12:05:36,865 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-15 12:05:36,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {5240#false} assume !(0 != #t~mem4);havoc #t~mem4; {5240#false} is VALID [2022-04-15 12:05:36,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {5240#false} ~cont~0 := 0;~i~0 := 0; {5240#false} is VALID [2022-04-15 12:05:36,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {5240#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5240#false} is VALID [2022-04-15 12:05:36,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {5240#false} ~i~0 := 0;~cont_aux~0 := 0; {5240#false} is VALID [2022-04-15 12:05:36,866 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-15 12:05:36,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {5240#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5240#false} is VALID [2022-04-15 12:05:36,866 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-15 12:05:36,866 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-15 12:05:36,866 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-15 12:05:36,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#false} assume !(~j~0 % 4294967296 < 2); {5240#false} is VALID [2022-04-15 12:05:36,867 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-15 12:05:36,869 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-15 12:05:36,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {5240#false} assume !(0 != #t~mem11);havoc #t~mem11; {5240#false} is VALID [2022-04-15 12:05:36,870 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-15 12:05:36,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {5240#false} ~cond := #in~cond; {5240#false} is VALID [2022-04-15 12:05:36,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {5240#false} assume 0 == ~cond; {5240#false} is VALID [2022-04-15 12:05:36,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-15 12:05:36,870 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-15 12:05:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:36,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137959519] [2022-04-15 12:05:36,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137959519] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:36,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239656210] [2022-04-15 12:05:36,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:36,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:36,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:36,872 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-15 12:05:36,897 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-15 12:05:36,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:36,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:36,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:05:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:36,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:37,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {5239#true} call ULTIMATE.init(); {5239#true} is VALID [2022-04-15 12:05:37,064 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-15 12:05:37,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-15 12:05:37,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-15 12:05:37,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,065 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-15 12:05:37,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#true} assume !(~i~0 % 4294967296 < 5); {5239#true} is VALID [2022-04-15 12:05:37,066 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-15 12:05:37,066 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-15 12:05:37,066 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-15 12:05:37,067 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-15 12:05:37,067 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-15 12:05:37,067 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-15 12:05:37,068 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-15 12:05:37,068 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-15 12:05:37,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {5240#false} ~i~0 := 0;~cont_aux~0 := 0; {5240#false} is VALID [2022-04-15 12:05:37,068 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-15 12:05:37,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {5240#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5240#false} is VALID [2022-04-15 12:05:37,068 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-15 12:05:37,068 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-15 12:05:37,068 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-15 12:05:37,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#false} assume !(~j~0 % 4294967296 < 2); {5240#false} is VALID [2022-04-15 12:05:37,069 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-15 12:05:37,069 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-15 12:05:37,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {5240#false} assume !(0 != #t~mem11);havoc #t~mem11; {5240#false} is VALID [2022-04-15 12:05:37,069 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-15 12:05:37,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {5240#false} ~cond := #in~cond; {5240#false} is VALID [2022-04-15 12:05:37,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {5240#false} assume 0 == ~cond; {5240#false} is VALID [2022-04-15 12:05:37,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-15 12:05:37,069 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-15 12:05:37,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:37,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#false} assume !false; {5240#false} is VALID [2022-04-15 12:05:37,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {5367#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5240#false} is VALID [2022-04-15 12:05:37,350 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-15 12:05:37,351 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-15 12:05:37,352 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-15 12:05:37,352 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-15 12:05:37,352 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-15 12:05:37,353 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-15 12:05:37,353 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-15 12:05:37,354 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-15 12:05:37,354 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-15 12:05:37,355 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-15 12:05:37,355 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-15 12:05:37,356 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-15 12:05:37,356 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-15 12:05:37,357 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-15 12:05:37,357 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-15 12:05:37,358 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-15 12:05:37,358 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-15 12:05:37,359 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-15 12:05:37,359 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-15 12:05:37,359 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-15 12:05:37,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {5239#true} assume !(~i~0 % 4294967296 < 5); {5239#true} is VALID [2022-04-15 12:05:37,359 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-15 12:05:37,359 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 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-15 12:05:37,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {5239#true} call #t~ret17 := main(); {5239#true} is VALID [2022-04-15 12:05:37,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5239#true} {5239#true} #133#return; {5239#true} is VALID [2022-04-15 12:05:37,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {5239#true} assume true; {5239#true} is VALID [2022-04-15 12:05:37,361 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-15 12:05:37,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {5239#true} call ULTIMATE.init(); {5239#true} is VALID [2022-04-15 12:05:37,361 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-15 12:05:37,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239656210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:37,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 10] total 19 [2022-04-15 12:05:37,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:37,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688177703] [2022-04-15 12:05:37,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688177703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:37,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:37,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:05:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566156170] [2022-04-15 12:05:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:37,365 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-15 12:05:37,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:37,366 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-15 12:05:37,395 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-15 12:05:37,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:05:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:37,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:05:37,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:05:37,396 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-15 12:05:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:38,688 INFO L93 Difference]: Finished difference Result 214 states and 291 transitions. [2022-04-15 12:05:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:05:38,688 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-15 12:05:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:38,689 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-15 12:05:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-04-15 12:05:38,697 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-15 12:05:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-04-15 12:05:38,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 169 transitions. [2022-04-15 12:05:38,840 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-15 12:05:38,842 INFO L225 Difference]: With dead ends: 214 [2022-04-15 12:05:38,842 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 12:05:38,843 INFO L912 BasicCegarLoop]: 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-15 12:05:38,843 INFO L913 BasicCegarLoop]: 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-15 12:05:38,843 INFO L914 BasicCegarLoop]: 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-15 12:05:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 12:05:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 55. [2022-04-15 12:05:38,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:38,975 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-15 12:05:38,975 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-15 12:05:38,976 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-15 12:05:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:38,981 INFO L93 Difference]: Finished difference Result 176 states and 241 transitions. [2022-04-15 12:05:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 241 transitions. [2022-04-15 12:05:38,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:38,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:38,983 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-15 12:05:38,983 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-15 12:05:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:38,989 INFO L93 Difference]: Finished difference Result 176 states and 241 transitions. [2022-04-15 12:05:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 241 transitions. [2022-04-15 12:05:38,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:38,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:38,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:38,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:38,997 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-15 12:05:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-04-15 12:05:38,998 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 37 [2022-04-15 12:05:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:38,998 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-04-15 12:05:38,998 INFO L479 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-15 12:05:38,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 67 transitions. [2022-04-15 12:05:39,109 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-15 12:05:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-15 12:05:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:05:39,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:39,112 INFO L499 BasicCegarLoop]: 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-15 12:05:39,137 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-15 12:05:39,327 WARN L460 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-15 12:05:39,328 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 543457835, now seen corresponding path program 9 times [2022-04-15 12:05:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:39,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920628090] [2022-04-15 12:05:39,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:39,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 543457835, now seen corresponding path program 10 times [2022-04-15 12:05:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274764655] [2022-04-15 12:05:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:39,412 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-15 12:05:39,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-15 12:05:39,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-15 12:05:39,413 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-15 12:05:39,413 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-15 12:05:39,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-15 12:05:39,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-15 12:05:39,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-15 12:05:39,413 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-15 12:05:39,413 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,414 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-15 12:05:39,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-15 12:05:39,415 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-15 12:05:39,415 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-15 12:05:39,415 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-15 12:05:39,415 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-15 12:05:39,415 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-15 12:05:39,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {6382#true} assume !(0 != #t~mem4);havoc #t~mem4; {6382#true} is VALID [2022-04-15 12:05:39,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {6382#true} ~cont~0 := 0;~i~0 := 0; {6382#true} is VALID [2022-04-15 12:05:39,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6382#true} is VALID [2022-04-15 12:05:39,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {6382#true} ~i~0 := 0;~cont_aux~0 := 0; {6382#true} is VALID [2022-04-15 12:05:39,416 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-15 12:05:39,416 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-15 12:05:39,416 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-15 12:05:39,417 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-15 12:05:39,417 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-15 12:05:39,418 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-15 12:05:39,418 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-15 12:05:39,418 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-15 12:05:39,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-15 12:05:39,418 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-15 12:05:39,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-15 12:05:39,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-15 12:05:39,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-15 12:05:39,419 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-15 12:05:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274764655] [2022-04-15 12:05:39,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274764655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400878816] [2022-04-15 12:05:39,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:05:39,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:39,422 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-15 12:05:39,423 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-15 12:05:39,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:05:39,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:05:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:39,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:39,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {6382#true} call ULTIMATE.init(); {6382#true} is VALID [2022-04-15 12:05:39,624 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-15 12:05:39,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-15 12:05:39,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-15 12:05:39,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,625 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-15 12:05:39,626 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-15 12:05:39,626 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-15 12:05:39,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-15 12:05:39,626 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-15 12:05:39,626 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-15 12:05:39,626 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-15 12:05:39,627 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-15 12:05:39,627 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-15 12:05:39,627 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-15 12:05:39,628 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-15 12:05:39,628 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-15 12:05:39,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {6383#false} ~i~0 := 0;~cont_aux~0 := 0; {6383#false} is VALID [2022-04-15 12:05:39,629 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-15 12:05:39,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {6383#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {6383#false} is VALID [2022-04-15 12:05:39,629 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-15 12:05:39,629 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-15 12:05:39,629 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-15 12:05:39,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {6383#false} assume !(~j~0 % 4294967296 < 2); {6383#false} is VALID [2022-04-15 12:05:39,629 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-15 12:05:39,629 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-15 12:05:39,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-15 12:05:39,629 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-15 12:05:39,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-15 12:05:39,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-15 12:05:39,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-15 12:05:39,630 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-15 12:05:39,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:39,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {6383#false} assume !false; {6383#false} is VALID [2022-04-15 12:05:39,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {6383#false} assume 0 == ~cond; {6383#false} is VALID [2022-04-15 12:05:39,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {6383#false} ~cond := #in~cond; {6383#false} is VALID [2022-04-15 12:05:39,740 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-15 12:05:39,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {6383#false} assume !(0 != #t~mem11);havoc #t~mem11; {6383#false} is VALID [2022-04-15 12:05:39,740 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-15 12:05:39,740 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-15 12:05:39,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {6531#(< (mod main_~j~0 4294967296) 2)} assume !(~j~0 % 4294967296 < 2); {6383#false} is VALID [2022-04-15 12:05:39,742 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-15 12:05:39,742 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-15 12:05:39,742 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-15 12:05:39,743 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-15 12:05:39,743 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-15 12:05:39,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {6382#true} ~i~0 := 0;~cont_aux~0 := 0; {6382#true} is VALID [2022-04-15 12:05:39,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6382#true} is VALID [2022-04-15 12:05:39,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {6382#true} ~cont~0 := 0;~i~0 := 0; {6382#true} is VALID [2022-04-15 12:05:39,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {6382#true} assume !(0 != #t~mem4);havoc #t~mem4; {6382#true} is VALID [2022-04-15 12:05:39,743 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-15 12:05:39,743 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-15 12:05:39,743 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-15 12:05:39,743 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-15 12:05:39,743 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-15 12:05:39,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#true} assume !(~i~0 % 4294967296 < 5); {6382#true} is VALID [2022-04-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,744 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-15 12:05:39,746 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-15 12:05:39,746 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-15 12:05:39,747 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-15 12:05:39,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {6382#true} call #t~ret17 := main(); {6382#true} is VALID [2022-04-15 12:05:39,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6382#true} {6382#true} #133#return; {6382#true} is VALID [2022-04-15 12:05:39,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {6382#true} assume true; {6382#true} is VALID [2022-04-15 12:05:39,747 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-15 12:05:39,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {6382#true} call ULTIMATE.init(); {6382#true} is VALID [2022-04-15 12:05:39,747 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-15 12:05:39,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400878816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:39,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:39,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-15 12:05:39,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:39,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920628090] [2022-04-15 12:05:39,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920628090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:39,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:39,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:05:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948907880] [2022-04-15 12:05:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:39,749 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-15 12:05:39,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:39,749 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-15 12:05:39,779 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-15 12:05:39,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:05:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:05:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:05:39,780 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-15 12:05:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:40,109 INFO L93 Difference]: Finished difference Result 110 states and 148 transitions. [2022-04-15 12:05:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:05:40,109 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-15 12:05:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:40,110 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-15 12:05:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 12:05:40,111 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-15 12:05:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 12:05:40,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-04-15 12:05:40,169 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-15 12:05:40,170 INFO L225 Difference]: With dead ends: 110 [2022-04-15 12:05:40,170 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:05:40,171 INFO L912 BasicCegarLoop]: 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-15 12:05:40,171 INFO L913 BasicCegarLoop]: 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-15 12:05:40,171 INFO L914 BasicCegarLoop]: 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-15 12:05:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:05:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2022-04-15 12:05:40,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:40,363 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-15 12:05:40,363 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-15 12:05:40,364 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-15 12:05:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:40,365 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-04-15 12:05:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-04-15 12:05:40,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:40,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:40,366 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-15 12:05:40,366 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-15 12:05:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:40,367 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2022-04-15 12:05:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-04-15 12:05:40,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:40,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:40,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:40,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:40,368 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-15 12:05:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2022-04-15 12:05:40,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 39 [2022-04-15 12:05:40,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:40,370 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2022-04-15 12:05:40,370 INFO L479 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-15 12:05:40,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 87 transitions. [2022-04-15 12:05:40,508 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-15 12:05:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-15 12:05:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:05:40,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:40,508 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:40,527 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-15 12:05:40,715 WARN L460 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-15 12:05:40,715 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -334288281, now seen corresponding path program 11 times [2022-04-15 12:05:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731411435] [2022-04-15 12:05:40,720 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:40,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -334288281, now seen corresponding path program 12 times [2022-04-15 12:05:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397196535] [2022-04-15 12:05:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:40,843 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-15 12:05:40,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-15 12:05:40,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-15 12:05:40,844 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-15 12:05:40,844 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-15 12:05:40,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-15 12:05:40,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-15 12:05:40,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-15 12:05:40,844 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-15 12:05:40,844 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-15 12:05:40,844 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 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-15 12:05:40,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-15 12:05:40,845 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-15 12:05:40,846 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-15 12:05:40,846 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-15 12:05:40,846 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-15 12:05:40,847 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-15 12:05:40,847 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-15 12:05:40,848 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-15 12:05:40,848 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-15 12:05:40,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-15 12:05:40,849 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-15 12:05:40,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-15 12:05:40,849 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-15 12:05:40,849 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-15 12:05:40,849 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-15 12:05:40,849 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-15 12:05:40,849 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-15 12:05:40,849 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-15 12:05:40,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-15 12:05:40,850 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-15 12:05:40,850 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-15 12:05:40,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-15 12:05:40,850 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-15 12:05:40,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-15 12:05:40,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-15 12:05:40,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-15 12:05:40,851 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-15 12:05:40,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:40,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397196535] [2022-04-15 12:05:40,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397196535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:40,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611125736] [2022-04-15 12:05:40,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:05:40,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:40,856 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-15 12:05:40,885 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-15 12:05:40,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:05:40,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:40,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:05:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:40,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:41,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {7153#true} call ULTIMATE.init(); {7153#true} is VALID [2022-04-15 12:05:41,317 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-15 12:05:41,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-15 12:05:41,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-15 12:05:41,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,318 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-15 12:05:41,319 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-15 12:05:41,319 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-15 12:05:41,319 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-15 12:05:41,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-15 12:05:41,319 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-15 12:05:41,319 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-15 12:05:41,320 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-15 12:05:41,320 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-15 12:05:41,321 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-15 12:05:41,321 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-15 12:05:41,322 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-15 12:05:41,322 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-15 12:05:41,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-15 12:05:41,322 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-15 12:05:41,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-15 12:05:41,323 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-15 12:05:41,323 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-15 12:05:41,323 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-15 12:05:41,323 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-15 12:05:41,323 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-15 12:05:41,323 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-15 12:05:41,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-15 12:05:41,323 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-15 12:05:41,324 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-15 12:05:41,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-15 12:05:41,324 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-15 12:05:41,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-15 12:05:41,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-15 12:05:41,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-15 12:05:41,324 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-15 12:05:41,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:41,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {7154#false} assume !false; {7154#false} is VALID [2022-04-15 12:05:41,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {7154#false} assume 0 == ~cond; {7154#false} is VALID [2022-04-15 12:05:41,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {7154#false} ~cond := #in~cond; {7154#false} is VALID [2022-04-15 12:05:41,458 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-15 12:05:41,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {7154#false} assume !(0 != #t~mem11);havoc #t~mem11; {7154#false} is VALID [2022-04-15 12:05:41,458 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-15 12:05:41,458 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-15 12:05:41,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {7154#false} assume !(~j~0 % 4294967296 < 2); {7154#false} is VALID [2022-04-15 12:05:41,458 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-15 12:05:41,458 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-15 12:05:41,459 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-15 12:05:41,459 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-15 12:05:41,459 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-15 12:05:41,459 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-15 12:05:41,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {7154#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7154#false} is VALID [2022-04-15 12:05:41,459 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-15 12:05:41,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {7154#false} ~i~0 := 0;~cont_aux~0 := 0; {7154#false} is VALID [2022-04-15 12:05:41,460 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-15 12:05:41,460 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-15 12:05:41,460 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-15 12:05:41,461 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-15 12:05:41,462 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-15 12:05:41,462 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-15 12:05:41,462 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-15 12:05:41,463 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-15 12:05:41,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#true} assume !(~i~0 % 4294967296 < 5); {7153#true} is VALID [2022-04-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,463 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-15 12:05:41,464 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-15 12:05:41,464 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-15 12:05:41,464 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-15 12:05:41,464 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-15 12:05:41,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {7153#true} call #t~ret17 := main(); {7153#true} is VALID [2022-04-15 12:05:41,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7153#true} {7153#true} #133#return; {7153#true} is VALID [2022-04-15 12:05:41,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {7153#true} assume true; {7153#true} is VALID [2022-04-15 12:05:41,464 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-15 12:05:41,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {7153#true} call ULTIMATE.init(); {7153#true} is VALID [2022-04-15 12:05:41,465 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-15 12:05:41,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611125736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:41,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2022-04-15 12:05:41,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:41,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731411435] [2022-04-15 12:05:41,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731411435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:41,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:05:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935317528] [2022-04-15 12:05:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:41,466 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-15 12:05:41,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:41,466 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-15 12:05:41,491 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-15 12:05:41,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:05:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:05:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:05:41,492 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-15 12:05:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:43,107 INFO L93 Difference]: Finished difference Result 255 states and 333 transitions. [2022-04-15 12:05:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:05:43,107 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-15 12:05:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:43,108 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-15 12:05:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-15 12:05:43,110 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-15 12:05:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-15 12:05:43,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-15 12:05:43,225 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-15 12:05:43,228 INFO L225 Difference]: With dead ends: 255 [2022-04-15 12:05:43,228 INFO L226 Difference]: Without dead ends: 229 [2022-04-15 12:05:43,228 INFO L912 BasicCegarLoop]: 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-15 12:05:43,228 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 129 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:43,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 62 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:05:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-15 12:05:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 77. [2022-04-15 12:05:43,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:43,521 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-15 12:05:43,521 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-15 12:05:43,522 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-15 12:05:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:43,527 INFO L93 Difference]: Finished difference Result 229 states and 299 transitions. [2022-04-15 12:05:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2022-04-15 12:05:43,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:43,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:43,528 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-15 12:05:43,528 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-15 12:05:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:43,534 INFO L93 Difference]: Finished difference Result 229 states and 299 transitions. [2022-04-15 12:05:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 299 transitions. [2022-04-15 12:05:43,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:43,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:43,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:43,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:43,535 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-15 12:05:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2022-04-15 12:05:43,536 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 42 [2022-04-15 12:05:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:43,537 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2022-04-15 12:05:43,537 INFO L479 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-15 12:05:43,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 95 transitions. [2022-04-15 12:05:43,688 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-15 12:05:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-04-15 12:05:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:05:43,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:43,688 INFO L499 BasicCegarLoop]: 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-15 12:05:43,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 12:05:43,891 WARN L460 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-15 12:05:43,891 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688413, now seen corresponding path program 13 times [2022-04-15 12:05:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:43,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486345019] [2022-04-15 12:05:43,905 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:43,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1673688413, now seen corresponding path program 14 times [2022-04-15 12:05:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:43,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836592068] [2022-04-15 12:05:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:44,012 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-15 12:05:44,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-15 12:05:44,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-15 12:05:44,012 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-15 12:05:44,012 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-15 12:05:44,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-15 12:05:44,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-15 12:05:44,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,013 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-15 12:05:44,014 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-15 12:05:44,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {8551#true} assume !(~i~0 % 4294967296 < 5); {8551#true} is VALID [2022-04-15 12:05:44,014 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-15 12:05:44,018 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-15 12:05:44,018 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-15 12:05:44,019 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-15 12:05:44,019 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-15 12:05:44,020 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-15 12:05:44,020 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-15 12:05:44,020 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-15 12:05:44,021 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-15 12:05:44,021 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-15 12:05:44,022 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-15 12:05:44,022 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-15 12:05:44,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {8552#false} ~i~0 := 0;~cont_aux~0 := 0; {8552#false} is VALID [2022-04-15 12:05:44,022 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-15 12:05:44,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {8552#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {8552#false} is VALID [2022-04-15 12:05:44,022 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-15 12:05:44,022 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-15 12:05:44,023 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-15 12:05:44,023 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-15 12:05:44,023 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-15 12:05:44,023 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-15 12:05:44,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {8552#false} assume !(~j~0 % 4294967296 < 2); {8552#false} is VALID [2022-04-15 12:05:44,023 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-15 12:05:44,023 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-15 12:05:44,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {8552#false} assume !(0 != #t~mem11);havoc #t~mem11; {8552#false} is VALID [2022-04-15 12:05:44,023 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-15 12:05:44,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-15 12:05:44,023 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-15 12:05:44,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-15 12:05:44,024 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-15 12:05:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:44,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836592068] [2022-04-15 12:05:44,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836592068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:44,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432139412] [2022-04-15 12:05:44,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:44,031 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-15 12:05:44,033 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-15 12:05:44,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:44,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:44,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:05:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:44,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:44,472 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-15 12:05:44,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {8551#true} call ULTIMATE.init(); {8551#true} is VALID [2022-04-15 12:05:44,494 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-15 12:05:44,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-15 12:05:44,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-15 12:05:44,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-15 12:05:44,495 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-15 12:05:44,496 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-15 12:05:44,496 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-15 12:05:44,497 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-15 12:05:44,497 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-15 12:05:44,497 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-15 12:05:44,498 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-15 12:05:44,498 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-15 12:05:44,498 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-15 12:05:44,499 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-15 12:05:44,499 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-15 12:05:44,499 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-15 12:05:44,500 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-15 12:05:44,500 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-15 12:05:44,500 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-15 12:05:44,501 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-15 12:05:44,501 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-15 12:05:44,502 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-15 12:05:44,502 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-15 12:05:44,503 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-15 12:05:44,503 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-15 12:05:44,503 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-15 12:05:44,504 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-15 12:05:44,504 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-15 12:05:44,505 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-15 12:05:44,505 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-15 12:05:44,506 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-15 12:05:44,506 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-15 12:05:44,507 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-15 12:05:44,507 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-15 12:05:44,508 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-15 12:05:44,508 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-15 12:05:44,508 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-15 12:05:44,509 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-15 12:05:44,509 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-15 12:05:44,510 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-15 12:05:44,510 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-15 12:05:44,510 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-15 12:05:44,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-15 12:05:44,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-15 12:05:44,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-15 12:05:44,511 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-15 12:05:44,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:44,670 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:05:44,671 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-15 12:05:44,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {8552#false} assume !false; {8552#false} is VALID [2022-04-15 12:05:44,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {8552#false} assume 0 == ~cond; {8552#false} is VALID [2022-04-15 12:05:44,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {8552#false} ~cond := #in~cond; {8552#false} is VALID [2022-04-15 12:05:44,759 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-15 12:05:44,759 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-15 12:05:44,760 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-15 12:05:44,760 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-15 12:05:44,761 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-15 12:05:44,761 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-15 12:05:44,761 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-15 12:05:44,762 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-15 12:05:44,762 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-15 12:05:44,763 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-15 12:05:44,763 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-15 12:05:44,764 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-15 12:05:44,764 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-15 12:05:44,765 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-15 12:05:44,765 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-15 12:05:44,765 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-15 12:05:44,766 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-15 12:05:44,766 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-15 12:05:44,766 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-15 12:05:44,767 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-15 12:05:44,767 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-15 12:05:44,768 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-15 12:05:44,769 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-15 12:05:44,769 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-15 12:05:44,769 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-15 12:05:44,769 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-15 12:05:44,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {8551#true} assume !(~i~0 % 4294967296 < 5); {8551#true} is VALID [2022-04-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,770 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-15 12:05:44,771 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-15 12:05:44,771 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-15 12:05:44,771 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-15 12:05:44,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {8551#true} call #t~ret17 := main(); {8551#true} is VALID [2022-04-15 12:05:44,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8551#true} {8551#true} #133#return; {8551#true} is VALID [2022-04-15 12:05:44,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {8551#true} assume true; {8551#true} is VALID [2022-04-15 12:05:44,771 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-15 12:05:44,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {8551#true} call ULTIMATE.init(); {8551#true} is VALID [2022-04-15 12:05:44,772 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-15 12:05:44,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432139412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:44,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:44,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 23 [2022-04-15 12:05:44,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486345019] [2022-04-15 12:05:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486345019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:44,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:44,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:05:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645372458] [2022-04-15 12:05:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:44,774 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-15 12:05:44,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:44,775 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-15 12:05:44,797 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-15 12:05:44,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:05:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:05:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:05:44,798 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-15 12:05:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:46,723 INFO L93 Difference]: Finished difference Result 270 states and 352 transitions. [2022-04-15 12:05:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:05:46,724 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-15 12:05:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:46,724 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-15 12:05:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-04-15 12:05:46,726 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-15 12:05:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-04-15 12:05:46,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 138 transitions. [2022-04-15 12:05:46,835 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-15 12:05:46,839 INFO L225 Difference]: With dead ends: 270 [2022-04-15 12:05:46,839 INFO L226 Difference]: Without dead ends: 244 [2022-04-15 12:05:46,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:05:46,840 INFO L913 BasicCegarLoop]: 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-15 12:05:46,840 INFO L914 BasicCegarLoop]: 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-15 12:05:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-15 12:05:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 79. [2022-04-15 12:05:47,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:47,157 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-15 12:05:47,157 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-15 12:05:47,157 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-15 12:05:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:47,163 INFO L93 Difference]: Finished difference Result 244 states and 319 transitions. [2022-04-15 12:05:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2022-04-15 12:05:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:47,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:47,164 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-15 12:05:47,164 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-15 12:05:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:47,170 INFO L93 Difference]: Finished difference Result 244 states and 319 transitions. [2022-04-15 12:05:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 319 transitions. [2022-04-15 12:05:47,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:47,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:47,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:47,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:47,171 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-15 12:05:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2022-04-15 12:05:47,172 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 46 [2022-04-15 12:05:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:47,173 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2022-04-15 12:05:47,173 INFO L479 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-15 12:05:47,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 98 transitions. [2022-04-15 12:05:47,391 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-15 12:05:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-15 12:05:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:05:47,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:47,392 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:47,419 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-15 12:05:47,592 WARN L460 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-15 12:05:47,593 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1875303096, now seen corresponding path program 15 times [2022-04-15 12:05:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:47,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145156565] [2022-04-15 12:05:47,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:47,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1875303096, now seen corresponding path program 16 times [2022-04-15 12:05:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086909116] [2022-04-15 12:05:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:47,736 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-15 12:05:47,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:05:47,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-15 12:05:47,737 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-15 12:05:47,737 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-15 12:05:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:05:47,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-15 12:05:47,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,738 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-15 12:05:47,739 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-15 12:05:47,739 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-15 12:05:47,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#true} assume !(~i~0 % 4294967296 < 5); {10048#true} is VALID [2022-04-15 12:05:47,739 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-15 12:05:47,739 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-15 12:05:47,739 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-15 12:05:47,740 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-15 12:05:47,740 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-15 12:05:47,741 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-15 12:05:47,741 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-15 12:05:47,741 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-15 12:05:47,742 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-15 12:05:47,742 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-15 12:05:47,743 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-15 12:05:47,743 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-15 12:05:47,743 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-15 12:05:47,744 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-15 12:05:47,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {10049#false} ~i~0 := 0;~cont_aux~0 := 0; {10049#false} is VALID [2022-04-15 12:05:47,744 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-15 12:05:47,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {10049#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {10049#false} is VALID [2022-04-15 12:05:47,744 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-15 12:05:47,744 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-15 12:05:47,744 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-15 12:05:47,744 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-15 12:05:47,744 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-15 12:05:47,745 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-15 12:05:47,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {10049#false} assume !(~j~0 % 4294967296 < 2); {10049#false} is VALID [2022-04-15 12:05:47,745 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-15 12:05:47,745 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-15 12:05:47,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {10049#false} assume !(0 != #t~mem11);havoc #t~mem11; {10049#false} is VALID [2022-04-15 12:05:47,745 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-15 12:05:47,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-15 12:05:47,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-15 12:05:47,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:05:47,745 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-15 12:05:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086909116] [2022-04-15 12:05:47,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086909116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:47,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123128395] [2022-04-15 12:05:47,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:05:47,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:47,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:47,747 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-15 12:05:47,748 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-15 12:05:47,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:05:47,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:47,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:05:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:47,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:48,171 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-15 12:05:48,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-15 12:05:48,189 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-15 12:05:48,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:05:48,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-15 12:05:48,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-15 12:05:48,190 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-15 12:05:48,191 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-15 12:05:48,191 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-15 12:05:48,191 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-15 12:05:48,192 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-15 12:05:48,192 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-15 12:05:48,192 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-15 12:05:48,193 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-15 12:05:48,193 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-15 12:05:48,193 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-15 12:05:48,193 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-15 12:05:48,194 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-15 12:05:48,194 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-15 12:05:48,194 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-15 12:05:48,195 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-15 12:05:48,195 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-15 12:05:48,195 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-15 12:05:48,196 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-15 12:05:48,196 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-15 12:05:48,197 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-15 12:05:48,197 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-15 12:05:48,197 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-15 12:05:48,198 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-15 12:05:48,198 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-15 12:05:48,198 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-15 12:05:48,199 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-15 12:05:48,199 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-15 12:05:48,200 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-15 12:05:48,200 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-15 12:05:48,201 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-15 12:05:48,201 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-15 12:05:48,201 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-15 12:05:48,202 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-15 12:05:48,202 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-15 12:05:48,203 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-15 12:05:48,203 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-15 12:05:48,203 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-15 12:05:48,204 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-15 12:05:48,204 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-15 12:05:48,204 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-15 12:05:48,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-15 12:05:48,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-15 12:05:48,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:05:48,205 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-15 12:05:48,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:48,362 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:05:48,363 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-15 12:05:48,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-15 12:05:48,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {10049#false} assume 0 == ~cond; {10049#false} is VALID [2022-04-15 12:05:48,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {10049#false} ~cond := #in~cond; {10049#false} is VALID [2022-04-15 12:05:48,439 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-15 12:05:48,439 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-15 12:05:48,440 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-15 12:05:48,440 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-15 12:05:48,441 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-15 12:05:48,441 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-15 12:05:48,442 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-15 12:05:48,442 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-15 12:05:48,443 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-15 12:05:48,443 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-15 12:05:48,443 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-15 12:05:48,444 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-15 12:05:48,444 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-15 12:05:48,445 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-15 12:05:48,445 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-15 12:05:48,445 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-15 12:05:48,445 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-15 12:05:48,446 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-15 12:05:48,446 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-15 12:05:48,446 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-15 12:05:48,447 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-15 12:05:48,447 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-15 12:05:48,447 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-15 12:05:48,448 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-15 12:05:48,448 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#true} assume !(~i~0 % 4294967296 < 5); {10048#true} is VALID [2022-04-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,449 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-15 12:05:48,450 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-15 12:05:48,450 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-15 12:05:48,450 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-15 12:05:48,450 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-15 12:05:48,450 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-15 12:05:48,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret17 := main(); {10048#true} is VALID [2022-04-15 12:05:48,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #133#return; {10048#true} is VALID [2022-04-15 12:05:48,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-15 12:05:48,450 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-15 12:05:48,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-15 12:05:48,450 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-15 12:05:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123128395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:48,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:48,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2022-04-15 12:05:48,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:48,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145156565] [2022-04-15 12:05:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145156565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:48,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:48,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:05:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180264939] [2022-04-15 12:05:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:48,452 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-15 12:05:48,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:48,452 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-15 12:05:48,475 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-15 12:05:48,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:05:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:05:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:05:48,476 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-15 12:05:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:51,140 INFO L93 Difference]: Finished difference Result 317 states and 415 transitions. [2022-04-15 12:05:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:05:51,140 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-15 12:05:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:51,141 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-15 12:05:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-04-15 12:05:51,143 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-15 12:05:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-04-15 12:05:51,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 161 transitions. [2022-04-15 12:05:51,335 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-15 12:05:51,341 INFO L225 Difference]: With dead ends: 317 [2022-04-15 12:05:51,341 INFO L226 Difference]: Without dead ends: 291 [2022-04-15 12:05:51,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:05:51,342 INFO L913 BasicCegarLoop]: 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-15 12:05:51,343 INFO L914 BasicCegarLoop]: 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-15 12:05:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-15 12:05:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 81. [2022-04-15 12:05:51,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:51,694 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-15 12:05:51,695 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-15 12:05:51,695 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-15 12:05:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:51,702 INFO L93 Difference]: Finished difference Result 291 states and 382 transitions. [2022-04-15 12:05:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2022-04-15 12:05:51,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:51,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:51,703 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-15 12:05:51,703 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-15 12:05:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:51,709 INFO L93 Difference]: Finished difference Result 291 states and 382 transitions. [2022-04-15 12:05:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2022-04-15 12:05:51,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:51,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:51,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:51,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:51,711 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-15 12:05:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2022-04-15 12:05:51,712 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 48 [2022-04-15 12:05:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:51,712 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2022-04-15 12:05:51,712 INFO L479 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-15 12:05:51,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 101 transitions. [2022-04-15 12:05:51,948 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-15 12:05:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2022-04-15 12:05:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:05:51,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:51,949 INFO L499 BasicCegarLoop]: 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-15 12:05:51,975 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-15 12:05:52,149 WARN L460 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-15 12:05:52,150 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1941482157, now seen corresponding path program 17 times [2022-04-15 12:05:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:52,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604477495] [2022-04-15 12:05:52,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:52,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1941482157, now seen corresponding path program 18 times [2022-04-15 12:05:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:52,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277247621] [2022-04-15 12:05:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:52,349 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-15 12:05:52,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-15 12:05:52,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-15 12:05:52,350 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-15 12:05:52,350 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-15 12:05:52,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-15 12:05:52,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-15 12:05:52,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {11751#true} call #t~ret17 := main(); {11751#true} is VALID [2022-04-15 12:05:52,350 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-15 12:05:52,350 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 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-15 12:05:52,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {11751#true} assume !(~i~0 % 4294967296 < 5); {11751#true} is VALID [2022-04-15 12:05:52,351 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-15 12:05:52,352 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-15 12:05:52,352 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-15 12:05:52,353 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-15 12:05:52,353 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-15 12:05:52,354 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-15 12:05:52,354 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-15 12:05:52,355 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-15 12:05:52,356 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-15 12:05:52,356 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-15 12:05:52,357 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-15 12:05:52,357 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-15 12:05:52,358 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-15 12:05:52,358 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-15 12:05:52,359 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-15 12:05:52,360 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-15 12:05:52,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {11752#false} ~i~0 := 0;~cont_aux~0 := 0; {11752#false} is VALID [2022-04-15 12:05:52,360 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-15 12:05:52,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {11752#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {11752#false} is VALID [2022-04-15 12:05:52,360 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-15 12:05:52,360 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-15 12:05:52,360 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-15 12:05:52,360 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-15 12:05:52,360 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-15 12:05:52,360 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-15 12:05:52,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {11752#false} assume !(~j~0 % 4294967296 < 2); {11752#false} is VALID [2022-04-15 12:05:52,361 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-15 12:05:52,361 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-15 12:05:52,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {11752#false} assume !(0 != #t~mem11);havoc #t~mem11; {11752#false} is VALID [2022-04-15 12:05:52,361 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-15 12:05:52,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {11752#false} ~cond := #in~cond; {11752#false} is VALID [2022-04-15 12:05:52,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {11752#false} assume 0 == ~cond; {11752#false} is VALID [2022-04-15 12:05:52,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2022-04-15 12:05:52,361 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-15 12:05:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:52,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277247621] [2022-04-15 12:05:52,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277247621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:52,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044857363] [2022-04-15 12:05:52,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:05:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:52,367 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-15 12:05:52,387 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-15 12:05:52,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:05:52,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:52,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:05:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:52,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:05:52,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:05:52,934 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-15 12:05:52,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {11751#true} call ULTIMATE.init(); {11751#true} is VALID [2022-04-15 12:05:52,974 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-15 12:05:52,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {11751#true} assume true; {11751#true} is VALID [2022-04-15 12:05:52,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11751#true} {11751#true} #133#return; {11751#true} is VALID [2022-04-15 12:05:52,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {11751#true} call #t~ret17 := main(); {11751#true} is VALID [2022-04-15 12:05:52,975 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-15 12:05:52,976 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-15 12:05:52,976 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-15 12:05:52,991 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-15 12:05:52,991 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-15 12:05:52,992 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-15 12:05:52,992 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-15 12:05:52,993 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-15 12:05:52,993 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-15 12:05:52,993 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-15 12:05:52,994 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-15 12:05:52,994 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-15 12:05:52,994 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-15 12:05:52,995 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-15 12:05:52,995 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-15 12:05:52,995 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-15 12:05:52,996 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-15 12:05:52,996 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-15 12:05:52,996 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-15 12:05:52,997 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-15 12:05:52,997 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-15 12:05:52,997 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-15 12:05:52,998 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-15 12:05:52,998 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-15 12:05:52,999 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-15 12:05:52,999 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-15 12:05:53,000 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-15 12:05:53,001 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-15 12:05:53,002 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-15 12:05:53,003 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-15 12:05:53,003 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-15 12:05:53,003 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-15 12:05:53,004 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-15 12:05:53,004 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-15 12:05:53,004 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-15 12:05:53,004 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-15 12:05:53,004 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-15 12:05:53,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {11752#false} assume !(~j~0 % 4294967296 < 2); {11752#false} is VALID [2022-04-15 12:05:53,004 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-15 12:05:53,004 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-15 12:05:53,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {11752#false} assume !(0 != #t~mem11);havoc #t~mem11; {11752#false} is VALID [2022-04-15 12:05:53,004 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-15 12:05:53,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {11752#false} ~cond := #in~cond; {11752#false} is VALID [2022-04-15 12:05:53,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {11752#false} assume 0 == ~cond; {11752#false} is VALID [2022-04-15 12:05:53,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {11752#false} assume !false; {11752#false} is VALID [2022-04-15 12:05:53,005 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-15 12:05:53,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:05:53,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044857363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:53,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:05:53,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-04-15 12:05:53,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604477495] [2022-04-15 12:05:53,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604477495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:53,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:53,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:05:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396789961] [2022-04-15 12:05:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:53,007 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-15 12:05:53,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:53,007 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-15 12:05:53,030 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-15 12:05:53,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:05:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:53,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:05:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:05:53,031 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-15 12:05:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:53,706 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2022-04-15 12:05:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:05:53,706 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-15 12:05:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:53,706 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-15 12:05:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 12:05:53,707 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-15 12:05:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 12:05:53,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 12:05:53,753 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-15 12:05:53,754 INFO L225 Difference]: With dead ends: 125 [2022-04-15 12:05:53,754 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 12:05:53,754 INFO L912 BasicCegarLoop]: 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-15 12:05:53,755 INFO L913 BasicCegarLoop]: 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-15 12:05:53,755 INFO L914 BasicCegarLoop]: 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-15 12:05:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 12:05:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2022-04-15 12:05:54,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:54,091 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-15 12:05:54,092 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-15 12:05:54,092 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-15 12:05:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:54,093 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-15 12:05:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-15 12:05:54,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:54,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:54,094 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-15 12:05:54,094 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-15 12:05:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:54,095 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-15 12:05:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2022-04-15 12:05:54,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:54,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:54,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:54,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:54,096 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-15 12:05:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-04-15 12:05:54,097 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 50 [2022-04-15 12:05:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:54,097 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-04-15 12:05:54,098 INFO L479 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-15 12:05:54,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 88 transitions. [2022-04-15 12:05:54,351 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-15 12:05:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-15 12:05:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:05:54,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:54,353 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:54,378 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-15 12:05:54,567 WARN L460 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-15 12:05:54,568 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:54,568 INFO L85 PathProgramCache]: Analyzing trace with hash 28908263, now seen corresponding path program 1 times [2022-04-15 12:05:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:54,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102022885] [2022-04-15 12:05:54,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:05:54,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:05:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash 28908263, now seen corresponding path program 2 times [2022-04-15 12:05:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:54,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289924030] [2022-04-15 12:05:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:54,779 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-15 12:05:54,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-15 12:05:54,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-15 12:05:54,780 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-15 12:05:54,780 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-15 12:05:54,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-15 12:05:54,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-15 12:05:54,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,781 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-15 12:05:54,782 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-15 12:05:54,782 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-15 12:05:54,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-15 12:05:54,782 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-15 12:05:54,782 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-15 12:05:54,782 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-15 12:05:54,782 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-15 12:05:54,782 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-15 12:05:54,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-15 12:05:54,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#true} ~cont~0 := 0;~i~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-15 12:05:54,783 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-15 12:05:54,783 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-15 12:05:54,784 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-15 12:05:54,784 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-15 12:05:54,785 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-15 12:05:54,785 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-15 12:05:54,786 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-15 12:05:54,786 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-15 12:05:54,786 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-15 12:05:54,787 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-15 12:05:54,787 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-15 12:05:54,788 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-15 12:05:54,788 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-15 12:05:54,789 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-15 12:05:54,789 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-15 12:05:54,790 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-15 12:05:54,790 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-15 12:05:54,791 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-15 12:05:54,791 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-15 12:05:54,792 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-15 12:05:54,792 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-15 12:05:54,793 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-15 12:05:54,793 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-15 12:05:54,794 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-15 12:05:54,794 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-15 12:05:54,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {12523#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12512#false} is VALID [2022-04-15 12:05:54,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-15 12:05:54,795 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-15 12:05:54,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:54,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289924030] [2022-04-15 12:05:54,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289924030] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:05:54,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671867590] [2022-04-15 12:05:54,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:05:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:05:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:05:54,797 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-15 12:05:54,798 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-15 12:05:54,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:05:54,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:05:54,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:05:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:54,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:05:55,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2022-04-15 12:05:55,337 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-15 12:05:55,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-15 12:05:55,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-15 12:05:55,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-15 12:05:55,338 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-15 12:05:55,338 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-15 12:05:55,338 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 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-15 12:05:55,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-15 12:05:55,340 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-15 12:05:55,340 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-15 12:05:55,340 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-15 12:05:55,340 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-15 12:05:55,340 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-15 12:05:55,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-15 12:05:55,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {12511#true} ~cont~0 := 0;~i~0 := 0; {12516#(= main_~cont~0 0)} is VALID [2022-04-15 12:05:55,340 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-15 12:05:55,341 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-15 12:05:55,341 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-15 12:05:55,341 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-15 12:05:55,342 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-15 12:05:55,342 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-15 12:05:55,343 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-15 12:05:55,343 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-15 12:05:55,343 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-15 12:05:55,344 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-15 12:05:55,344 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-15 12:05:55,344 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-15 12:05:55,345 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-15 12:05:55,345 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-15 12:05:55,346 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-15 12:05:55,346 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-15 12:05:55,346 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-15 12:05:55,347 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-15 12:05:55,347 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-15 12:05:55,347 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-15 12:05:55,348 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-15 12:05:55,348 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-15 12:05:55,349 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-15 12:05:55,349 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-15 12:05:55,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:05:55,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {12677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12512#false} is VALID [2022-04-15 12:05:55,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-15 12:05:55,350 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-15 12:05:55,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:05:55,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {12512#false} assume !false; {12512#false} is VALID [2022-04-15 12:05:55,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {12677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12512#false} is VALID [2022-04-15 12:05:55,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {12673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:05:55,600 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-15 12:05:55,601 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-15 12:05:55,601 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-15 12:05:55,601 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-15 12:05:55,602 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-15 12:05:55,602 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-15 12:05:55,603 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-15 12:05:55,603 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-15 12:05:55,603 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-15 12:05:55,604 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-15 12:05:55,604 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-15 12:05:55,604 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-15 12:05:55,605 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-15 12:05:55,605 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-15 12:05:55,605 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-15 12:05:55,606 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-15 12:05:55,606 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-15 12:05:55,606 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-15 12:05:55,607 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-15 12:05:55,607 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-15 12:05:55,607 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-15 12:05:55,608 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-15 12:05:55,608 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-15 12:05:55,609 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-15 12:05:55,609 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-15 12:05:55,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {12511#true} assume !(0 != #t~mem4);havoc #t~mem4; {12511#true} is VALID [2022-04-15 12:05:55,609 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-15 12:05:55,609 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-15 12:05:55,609 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-15 12:05:55,609 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-15 12:05:55,609 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-15 12:05:55,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {12511#true} assume !(~i~0 % 4294967296 < 5); {12511#true} is VALID [2022-04-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 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-15 12:05:55,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {12511#true} call #t~ret17 := main(); {12511#true} is VALID [2022-04-15 12:05:55,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12511#true} {12511#true} #133#return; {12511#true} is VALID [2022-04-15 12:05:55,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {12511#true} assume true; {12511#true} is VALID [2022-04-15 12:05:55,611 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-15 12:05:55,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {12511#true} call ULTIMATE.init(); {12511#true} is VALID [2022-04-15 12:05:55,611 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-15 12:05:55,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671867590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:05:55,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:05:55,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 23 [2022-04-15 12:05:55,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:55,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102022885] [2022-04-15 12:05:55,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102022885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:55,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:55,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:05:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161213774] [2022-04-15 12:05:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:55,612 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-15 12:05:55,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:55,613 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-15 12:05:55,650 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-15 12:05:55,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:05:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:05:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:05:55,651 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-15 12:05:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:58,477 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2022-04-15 12:05:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:05:58,477 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-15 12:05:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:58,477 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-15 12:05:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-04-15 12:05:58,479 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-15 12:05:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-04-15 12:05:58,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 155 transitions. [2022-04-15 12:05:58,604 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-15 12:05:58,607 INFO L225 Difference]: With dead ends: 188 [2022-04-15 12:05:58,607 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 12:05:58,607 INFO L912 BasicCegarLoop]: 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-15 12:05:58,608 INFO L913 BasicCegarLoop]: 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-15 12:05:58,608 INFO L914 BasicCegarLoop]: 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-15 12:05:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 12:05:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2022-04-15 12:05:59,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:59,426 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-15 12:05:59,426 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-15 12:05:59,427 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-15 12:05:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:59,430 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2022-04-15 12:05:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2022-04-15 12:05:59,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:59,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:59,431 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-15 12:05:59,431 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-15 12:05:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:59,435 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2022-04-15 12:05:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 236 transitions. [2022-04-15 12:05:59,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:59,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:59,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:59,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:59,436 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-15 12:05:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-04-15 12:05:59,438 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 51 [2022-04-15 12:05:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:59,438 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-04-15 12:05:59,438 INFO L479 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-15 12:05:59,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 148 transitions. [2022-04-15 12:05:59,904 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-15 12:05:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-04-15 12:05:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:05:59,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:59,905 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:59,931 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-15 12:06:00,106 WARN L460 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-15 12:06:00,106 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash -364118747, now seen corresponding path program 1 times [2022-04-15 12:06:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:00,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084430170] [2022-04-15 12:06:00,111 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:00,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash -364118747, now seen corresponding path program 2 times [2022-04-15 12:06:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284108570] [2022-04-15 12:06:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:00,595 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-15 12:06:00,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-15 12:06:00,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-15 12:06:00,596 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-15 12:06:00,596 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-15 12:06:00,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-15 12:06:00,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-15 12:06:00,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-15 12:06:00,598 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-15 12:06:00,598 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-15 12:06:00,599 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-15 12:06:00,600 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-15 12:06:00,600 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-15 12:06:00,601 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-15 12:06:00,601 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-15 12:06:00,602 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-15 12:06:00,603 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-15 12:06:00,603 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-15 12:06:00,604 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-15 12:06:00,604 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-15 12:06:00,605 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-15 12:06:00,605 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-15 12:06:00,606 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-15 12:06:00,606 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-15 12:06:00,607 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-15 12:06:00,607 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-15 12:06:00,608 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-15 12:06:00,608 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-15 12:06:00,609 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-15 12:06:00,610 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-15 12:06:00,611 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-15 12:06:00,612 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-15 12:06:00,612 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-15 12:06:00,612 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-15 12:06:00,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-15 12:06:00,613 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-15 12:06:00,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {13837#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {13837#false} is VALID [2022-04-15 12:06:00,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {13837#false} ~i~0 := 0;~cont_aux~0 := 0; {13837#false} is VALID [2022-04-15 12:06:00,613 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-15 12:06:00,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {13837#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {13837#false} is VALID [2022-04-15 12:06:00,613 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-15 12:06:00,613 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-15 12:06:00,613 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-15 12:06:00,613 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-15 12:06:00,614 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-15 12:06:00,614 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-15 12:06:00,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-15 12:06:00,614 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-15 12:06:00,614 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-15 12:06:00,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-15 12:06:00,614 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-15 12:06:00,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-15 12:06:00,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-15 12:06:00,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-15 12:06:00,615 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-15 12:06:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284108570] [2022-04-15 12:06:00,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284108570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231660485] [2022-04-15 12:06:00,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:06:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:00,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:00,620 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-15 12:06:00,646 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-15 12:06:00,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:06:00,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:00,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:06:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:00,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:01,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:06:01,220 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-15 12:06:01,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2022-04-15 12:06:01,245 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-15 12:06:01,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-15 12:06:01,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-15 12:06:01,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-15 12:06:01,246 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-15 12:06:01,247 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-15 12:06:01,247 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-15 12:06:01,247 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-15 12:06:01,248 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-15 12:06:01,248 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-15 12:06:01,249 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-15 12:06:01,249 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-15 12:06:01,249 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-15 12:06:01,250 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-15 12:06:01,250 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-15 12:06:01,250 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-15 12:06:01,251 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-15 12:06:01,251 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-15 12:06:01,251 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-15 12:06:01,252 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-15 12:06:01,252 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-15 12:06:01,253 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-15 12:06:01,253 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-15 12:06:01,253 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-15 12:06:01,254 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-15 12:06:01,254 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-15 12:06:01,255 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-15 12:06:01,255 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-15 12:06:01,255 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-15 12:06:01,256 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-15 12:06:01,256 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-15 12:06:01,257 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-15 12:06:01,257 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-15 12:06:01,257 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-15 12:06:01,258 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-15 12:06:01,258 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-15 12:06:01,259 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-15 12:06:01,259 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-15 12:06:01,260 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-15 12:06:01,260 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-15 12:06:01,261 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-15 12:06:01,261 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-15 12:06:01,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-15 12:06:01,261 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-15 12:06:01,261 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-15 12:06:01,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-15 12:06:01,261 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-15 12:06:01,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-15 12:06:01,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-15 12:06:01,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-15 12:06:01,262 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-15 12:06:01,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:02,238 INFO L356 Elim1Store]: treesize reduction 31, result has 68.0 percent of original size [2022-04-15 12:06:02,238 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-15 12:06:02,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2022-04-15 12:06:02,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {13837#false} assume 0 == ~cond; {13837#false} is VALID [2022-04-15 12:06:02,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {13837#false} ~cond := #in~cond; {13837#false} is VALID [2022-04-15 12:06:02,543 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-15 12:06:02,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {13837#false} assume !(0 != #t~mem11);havoc #t~mem11; {13837#false} is VALID [2022-04-15 12:06:02,543 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-15 12:06:02,543 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-15 12:06:02,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {13837#false} assume !(~j~0 % 4294967296 < 2); {13837#false} is VALID [2022-04-15 12:06:02,543 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-15 12:06:02,543 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-15 12:06:02,544 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-15 12:06:02,545 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-15 12:06:02,546 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-15 12:06:02,546 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-15 12:06:02,547 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-15 12:06:02,547 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-15 12:06:02,548 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-15 12:06:02,548 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-15 12:06:02,548 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-15 12:06:02,549 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-15 12:06:02,549 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-15 12:06:02,550 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-15 12:06:02,551 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-15 12:06:02,552 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-15 12:06:02,553 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-15 12:06:02,554 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-15 12:06:02,554 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-15 12:06:02,555 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-15 12:06:02,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {13836#true} assume !(0 != #t~mem4);havoc #t~mem4; {13836#true} is VALID [2022-04-15 12:06:02,555 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-15 12:06:02,555 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-15 12:06:02,555 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-15 12:06:02,555 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-15 12:06:02,556 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-15 12:06:02,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {13836#true} assume !(~i~0 % 4294967296 < 5); {13836#true} is VALID [2022-04-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,556 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-15 12:06:02,557 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-15 12:06:02,557 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-15 12:06:02,557 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-15 12:06:02,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret17 := main(); {13836#true} is VALID [2022-04-15 12:06:02,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #133#return; {13836#true} is VALID [2022-04-15 12:06:02,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2022-04-15 12:06:02,557 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-15 12:06:02,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2022-04-15 12:06:02,558 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-15 12:06:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231660485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:02,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 29 [2022-04-15 12:06:02,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:02,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084430170] [2022-04-15 12:06:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084430170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:02,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:06:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534139693] [2022-04-15 12:06:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:02,559 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-15 12:06:02,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:02,559 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-15 12:06:02,593 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-15 12:06:02,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:06:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:02,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:06:02,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=1, NotChecked=0, Total=812 [2022-04-15 12:06:02,595 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-15 12:06:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:04,032 INFO L93 Difference]: Finished difference Result 197 states and 254 transitions. [2022-04-15 12:06:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:06:04,032 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-15 12:06:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:04,033 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-15 12:06:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-15 12:06:04,034 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-15 12:06:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-15 12:06:04,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-15 12:06:04,099 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-15 12:06:04,101 INFO L225 Difference]: With dead ends: 197 [2022-04-15 12:06:04,101 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 12:06:04,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=1036, Unknown=1, NotChecked=0, Total=1190 [2022-04-15 12:06:04,102 INFO L913 BasicCegarLoop]: 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-15 12:06:04,102 INFO L914 BasicCegarLoop]: 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-15 12:06:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 12:06:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2022-04-15 12:06:04,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:04,930 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-15 12:06:04,931 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-15 12:06:04,931 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-15 12:06:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:04,933 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 12:06:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 12:06:04,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:04,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:04,934 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-15 12:06:04,934 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-15 12:06:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:04,936 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 12:06:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 12:06:04,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:04,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:04,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:04,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:04,937 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-15 12:06:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2022-04-15 12:06:04,939 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 51 [2022-04-15 12:06:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:04,940 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2022-04-15 12:06:04,940 INFO L479 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-15 12:06:04,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 157 transitions. [2022-04-15 12:06:05,475 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-15 12:06:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2022-04-15 12:06:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:06:05,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:05,476 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:05,495 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-15 12:06:05,683 WARN L460 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-15 12:06:05,683 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 247762981, now seen corresponding path program 1 times [2022-04-15 12:06:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153280561] [2022-04-15 12:06:05,688 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:05,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 247762981, now seen corresponding path program 2 times [2022-04-15 12:06:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:05,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161063373] [2022-04-15 12:06:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:06,081 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-15 12:06:06,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-15 12:06:06,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-15 12:06:06,082 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-15 12:06:06,082 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-15 12:06:06,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-15 12:06:06,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-15 12:06:06,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-15 12:06:06,083 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-15 12:06:06,084 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-15 12:06:06,085 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-15 12:06:06,085 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-15 12:06:06,086 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-15 12:06:06,086 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-15 12:06:06,087 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-15 12:06:06,088 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-15 12:06:06,088 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-15 12:06:06,089 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-15 12:06:06,089 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-15 12:06:06,090 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-15 12:06:06,090 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-15 12:06:06,091 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-15 12:06:06,091 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-15 12:06:06,091 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-15 12:06:06,092 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-15 12:06:06,092 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-15 12:06:06,093 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-15 12:06:06,093 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-15 12:06:06,094 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-15 12:06:06,094 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-15 12:06:06,095 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-15 12:06:06,095 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-15 12:06:06,096 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-15 12:06:06,096 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-15 12:06:06,096 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-15 12:06:06,097 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-15 12:06:06,097 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-15 12:06:06,098 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-15 12:06:06,098 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-15 12:06:06,099 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-15 12:06:06,100 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-15 12:06:06,100 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-15 12:06:06,101 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-15 12:06:06,102 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-15 12:06:06,102 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-15 12:06:06,102 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-15 12:06:06,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-15 12:06:06,103 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-15 12:06:06,103 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-15 12:06:06,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-15 12:06:06,103 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-15 12:06:06,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-15 12:06:06,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-15 12:06:06,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-15 12:06:06,104 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-15 12:06:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:06,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161063373] [2022-04-15 12:06:06,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161063373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:06,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334441028] [2022-04-15 12:06:06,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:06:06,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:06,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:06,106 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-15 12:06:06,136 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-15 12:06:06,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:06:06,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:06,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 12:06:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:06,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:06,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:06:06,772 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-15 12:06:06,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {15085#true} call ULTIMATE.init(); {15085#true} is VALID [2022-04-15 12:06:06,789 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-15 12:06:06,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-15 12:06:06,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-15 12:06:06,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-15 12:06:06,790 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-15 12:06:06,791 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-15 12:06:06,791 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-15 12:06:06,791 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-15 12:06:06,792 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-15 12:06:06,792 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-15 12:06:06,792 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-15 12:06:06,793 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-15 12:06:06,793 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-15 12:06:06,794 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-15 12:06:06,794 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-15 12:06:06,794 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-15 12:06:06,795 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-15 12:06:06,795 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-15 12:06:06,795 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-15 12:06:06,796 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-15 12:06:06,796 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-15 12:06:06,796 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-15 12:06:06,797 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-15 12:06:06,797 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-15 12:06:06,798 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-15 12:06:06,798 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-15 12:06:06,799 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-15 12:06:06,799 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-15 12:06:06,799 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-15 12:06:06,800 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-15 12:06:06,800 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-15 12:06:06,801 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-15 12:06:06,801 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-15 12:06:06,801 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-15 12:06:06,802 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-15 12:06:06,802 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-15 12:06:06,803 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-15 12:06:06,803 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-15 12:06:06,804 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-15 12:06:06,804 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-15 12:06:06,804 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-15 12:06:06,804 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-15 12:06:06,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-15 12:06:06,805 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-15 12:06:06,805 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-15 12:06:06,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-15 12:06:06,805 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-15 12:06:06,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-15 12:06:06,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-15 12:06:06,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-15 12:06:06,805 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-15 12:06:06,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:10,173 INFO L356 Elim1Store]: treesize reduction 23, result has 76.3 percent of original size [2022-04-15 12:06:10,174 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-15 12:06:10,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {15086#false} assume !false; {15086#false} is VALID [2022-04-15 12:06:10,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {15086#false} assume 0 == ~cond; {15086#false} is VALID [2022-04-15 12:06:10,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {15086#false} ~cond := #in~cond; {15086#false} is VALID [2022-04-15 12:06:10,412 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-15 12:06:10,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {15086#false} assume !(0 != #t~mem11);havoc #t~mem11; {15086#false} is VALID [2022-04-15 12:06:10,412 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-15 12:06:10,412 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-15 12:06:10,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {15086#false} assume !(~j~0 % 4294967296 < 2); {15086#false} is VALID [2022-04-15 12:06:10,412 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-15 12:06:10,413 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-15 12:06:10,413 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-15 12:06:10,414 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-15 12:06:10,415 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-15 12:06:10,415 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-15 12:06:10,416 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-15 12:06:10,416 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-15 12:06:10,417 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-15 12:06:10,417 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-15 12:06:10,418 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-15 12:06:10,418 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-15 12:06:10,419 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-15 12:06:10,419 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-15 12:06:10,420 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-15 12:06:10,422 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-15 12:06:10,422 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-15 12:06:10,423 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-15 12:06:10,424 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-15 12:06:10,424 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-15 12:06:10,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {15085#true} assume !(0 != #t~mem4);havoc #t~mem4; {15085#true} is VALID [2022-04-15 12:06:10,424 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {15085#true} assume !(~i~0 % 4294967296 < 5); {15085#true} is VALID [2022-04-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,425 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-15 12:06:10,426 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-15 12:06:10,426 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-15 12:06:10,426 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-15 12:06:10,426 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-15 12:06:10,426 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-15 12:06:10,426 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-15 12:06:10,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {15085#true} call #t~ret17 := main(); {15085#true} is VALID [2022-04-15 12:06:10,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15085#true} {15085#true} #133#return; {15085#true} is VALID [2022-04-15 12:06:10,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {15085#true} assume true; {15085#true} is VALID [2022-04-15 12:06:10,427 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-15 12:06:10,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {15085#true} call ULTIMATE.init(); {15085#true} is VALID [2022-04-15 12:06:10,427 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-15 12:06:10,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334441028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:10,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 29 [2022-04-15 12:06:10,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:10,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153280561] [2022-04-15 12:06:10,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153280561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:10,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:10,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:06:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941083696] [2022-04-15 12:06:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:10,428 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-15 12:06:10,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:10,429 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-15 12:06:10,477 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-15 12:06:10,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:06:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:10,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:06:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=690, Unknown=6, NotChecked=0, Total=812 [2022-04-15 12:06:10,478 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-15 12:06:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:12,167 INFO L93 Difference]: Finished difference Result 162 states and 203 transitions. [2022-04-15 12:06:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:06:12,168 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-15 12:06:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:12,168 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-15 12:06:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-15 12:06:12,169 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-15 12:06:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-04-15 12:06:12,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2022-04-15 12:06:12,228 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-15 12:06:12,229 INFO L225 Difference]: With dead ends: 162 [2022-04-15 12:06:12,229 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 12:06:12,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=164, Invalid=1020, Unknown=6, NotChecked=0, Total=1190 [2022-04-15 12:06:12,230 INFO L913 BasicCegarLoop]: 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-15 12:06:12,230 INFO L914 BasicCegarLoop]: 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-15 12:06:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 12:06:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2022-04-15 12:06:13,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:13,164 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-15 12:06:13,164 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-15 12:06:13,164 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-15 12:06:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:13,166 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-15 12:06:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-04-15 12:06:13,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:13,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:13,167 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-15 12:06:13,167 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-15 12:06:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:13,169 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-15 12:06:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-04-15 12:06:13,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:13,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:13,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:13,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:13,170 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-15 12:06:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-04-15 12:06:13,172 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 51 [2022-04-15 12:06:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:13,173 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-04-15 12:06:13,173 INFO L479 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-15 12:06:13,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 166 transitions. [2022-04-15 12:06:13,647 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-15 12:06:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-04-15 12:06:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:06:13,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:13,648 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:13,665 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-15 12:06:13,851 WARN L460 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-15 12:06:13,851 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -732070043, now seen corresponding path program 1 times [2022-04-15 12:06:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1170123839] [2022-04-15 12:06:13,856 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:13,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -732070043, now seen corresponding path program 2 times [2022-04-15 12:06:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466189406] [2022-04-15 12:06:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:14,371 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-15 12:06:14,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:06:14,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-15 12:06:14,372 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-15 12:06:14,372 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-15 12:06:14,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:06:14,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-15 12:06:14,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 12:06:14,373 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-15 12:06:14,374 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-15 12:06:14,374 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-15 12:06:14,375 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-15 12:06:14,375 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-15 12:06:14,376 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-15 12:06:14,376 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-15 12:06:14,376 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-15 12:06:14,377 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-15 12:06:14,377 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-15 12:06:14,378 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-15 12:06:14,378 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-15 12:06:14,378 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-15 12:06:14,379 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-15 12:06:14,379 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-15 12:06:14,380 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-15 12:06:14,380 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-15 12:06:14,380 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-15 12:06:14,381 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-15 12:06:14,381 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-15 12:06:14,382 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-15 12:06:14,382 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-15 12:06:14,383 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-15 12:06:14,383 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-15 12:06:14,384 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-15 12:06:14,384 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-15 12:06:14,385 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-15 12:06:14,386 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-15 12:06:14,386 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-15 12:06:14,386 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-15 12:06:14,387 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-15 12:06:14,388 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-15 12:06:14,388 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-15 12:06:14,389 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-15 12:06:14,389 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-15 12:06:14,389 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-15 12:06:14,389 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-15 12:06:14,389 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-15 12:06:14,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-15 12:06:14,389 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-15 12:06:14,389 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-15 12:06:14,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-15 12:06:14,390 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-15 12:06:14,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 12:06:14,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:06:14,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:06:14,390 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-15 12:06:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:14,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466189406] [2022-04-15 12:06:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466189406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168331506] [2022-04-15 12:06:14,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:06:14,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:14,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:14,396 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-15 12:06:14,397 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-15 12:06:14,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:06:14,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:14,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:06:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:14,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:14,806 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 12:06:14,807 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-15 12:06:14,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 12:06:14,832 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-15 12:06:14,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:06:14,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-15 12:06:14,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 12:06:14,833 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-15 12:06:14,833 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-15 12:06:14,834 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-15 12:06:14,834 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-15 12:06:14,835 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-15 12:06:14,835 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-15 12:06:14,835 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-15 12:06:14,836 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-15 12:06:14,836 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-15 12:06:14,837 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-15 12:06:14,837 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-15 12:06:14,837 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-15 12:06:14,838 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-15 12:06:14,838 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-15 12:06:14,839 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-15 12:06:14,839 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-15 12:06:14,840 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-15 12:06:14,840 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-15 12:06:14,840 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-15 12:06:14,841 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-15 12:06:14,841 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-15 12:06:14,842 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-15 12:06:14,842 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-15 12:06:14,843 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-15 12:06:14,843 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-15 12:06:14,844 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-15 12:06:14,844 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-15 12:06:14,845 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-15 12:06:14,845 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-15 12:06:14,845 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-15 12:06:14,846 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-15 12:06:14,847 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-15 12:06:14,847 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-15 12:06:14,848 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-15 12:06:14,848 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-15 12:06:14,848 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-15 12:06:14,848 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-15 12:06:14,848 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-15 12:06:14,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-15 12:06:14,848 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-15 12:06:14,848 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-15 12:06:14,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-15 12:06:14,849 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-15 12:06:14,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 12:06:14,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:06:14,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:06:14,849 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-15 12:06:14,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:15,040 INFO L356 Elim1Store]: treesize reduction 27, result has 68.2 percent of original size [2022-04-15 12:06:15,041 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-15 12:06:15,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:06:15,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:06:15,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 12:06:15,279 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-15 12:06:15,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {16301#false} assume !(0 != #t~mem11);havoc #t~mem11; {16301#false} is VALID [2022-04-15 12:06:15,279 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-15 12:06:15,279 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-15 12:06:15,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {16301#false} assume !(~j~0 % 4294967296 < 2); {16301#false} is VALID [2022-04-15 12:06:15,279 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-15 12:06:15,279 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-15 12:06:15,279 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-15 12:06:15,279 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-15 12:06:15,280 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-15 12:06:15,280 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-15 12:06:15,281 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-15 12:06:15,281 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-15 12:06:15,282 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-15 12:06:15,282 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-15 12:06:15,283 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-15 12:06:15,283 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-15 12:06:15,284 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-15 12:06:15,284 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-15 12:06:15,285 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-15 12:06:15,285 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-15 12:06:15,285 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-15 12:06:15,286 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-15 12:06:15,287 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-15 12:06:15,291 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-15 12:06:15,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {16300#true} assume !(0 != #t~mem4);havoc #t~mem4; {16300#true} is VALID [2022-04-15 12:06:15,291 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-15 12:06:15,291 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-15 12:06:15,291 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-15 12:06:15,291 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-15 12:06:15,292 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-15 12:06:15,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {16300#true} assume !(~i~0 % 4294967296 < 5); {16300#true} is VALID [2022-04-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,292 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-15 12:06:15,293 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-15 12:06:15,293 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-15 12:06:15,293 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-15 12:06:15,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 12:06:15,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #133#return; {16300#true} is VALID [2022-04-15 12:06:15,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:06:15,293 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-15 12:06:15,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 12:06:15,293 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-15 12:06:15,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168331506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:15,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:15,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 19 [2022-04-15 12:06:15,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:15,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1170123839] [2022-04-15 12:06:15,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1170123839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:15,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:15,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:06:15,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995929370] [2022-04-15 12:06:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:15,295 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-15 12:06:15,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:15,296 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-15 12:06:15,331 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-15 12:06:15,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:06:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:06:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:06:15,332 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-15 12:06:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:18,556 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2022-04-15 12:06:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:06:18,557 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-15 12:06:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:18,557 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-15 12:06:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-15 12:06:18,558 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-15 12:06:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-15 12:06:18,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-04-15 12:06:18,677 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-15 12:06:18,684 INFO L225 Difference]: With dead ends: 372 [2022-04-15 12:06:18,684 INFO L226 Difference]: Without dead ends: 318 [2022-04-15 12:06:18,685 INFO L912 BasicCegarLoop]: 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-15 12:06:18,685 INFO L913 BasicCegarLoop]: 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-15 12:06:18,686 INFO L914 BasicCegarLoop]: 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-15 12:06:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-15 12:06:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 187. [2022-04-15 12:06:20,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:20,076 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-15 12:06:20,076 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-15 12:06:20,076 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-15 12:06:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:20,083 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2022-04-15 12:06:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 406 transitions. [2022-04-15 12:06:20,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:20,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:20,084 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-15 12:06:20,084 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-15 12:06:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:20,091 INFO L93 Difference]: Finished difference Result 318 states and 406 transitions. [2022-04-15 12:06:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 406 transitions. [2022-04-15 12:06:20,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:20,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:20,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:20,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:20,092 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-15 12:06:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2022-04-15 12:06:20,095 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 51 [2022-04-15 12:06:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:20,095 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2022-04-15 12:06:20,096 INFO L479 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-15 12:06:20,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 232 transitions. [2022-04-15 12:06:20,899 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-15 12:06:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2022-04-15 12:06:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:06:20,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:20,904 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:20,929 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-15 12:06:21,119 WARN L460 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-15 12:06:21,119 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash -810376151, now seen corresponding path program 3 times [2022-04-15 12:06:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:21,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352038525] [2022-04-15 12:06:21,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:21,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -810376151, now seen corresponding path program 4 times [2022-04-15 12:06:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048449530] [2022-04-15 12:06:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:21,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:21,914 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-15 12:06:21,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-15 12:06:21,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-15 12:06:21,915 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-15 12:06:21,915 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-15 12:06:21,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-15 12:06:21,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-15 12:06:21,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-15 12:06:21,916 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-15 12:06:21,917 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-15 12:06:21,917 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-15 12:06:21,918 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-15 12:06:21,918 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-15 12:06:21,919 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-15 12:06:21,919 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-15 12:06:21,919 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-15 12:06:21,920 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-15 12:06:21,920 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-15 12:06:21,920 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-15 12:06:21,921 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-15 12:06:21,921 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-15 12:06:21,921 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-15 12:06:21,922 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-15 12:06:21,922 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-15 12:06:21,923 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-15 12:06:21,925 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-15 12:06:21,926 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-15 12:06:21,931 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-15 12:06:21,932 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-15 12:06:21,932 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-15 12:06:21,933 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-15 12:06:21,934 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-15 12:06:21,934 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-15 12:06:21,935 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-15 12:06:21,935 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-15 12:06:21,936 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-15 12:06:21,936 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-15 12:06:21,937 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-15 12:06:21,937 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-15 12:06:21,938 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-15 12:06:21,938 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-15 12:06:21,939 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-15 12:06:21,939 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-15 12:06:21,940 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-15 12:06:21,940 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-15 12:06:21,940 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-15 12:06:21,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-15 12:06:21,940 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-15 12:06:21,941 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-15 12:06:21,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-15 12:06:21,941 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-15 12:06:21,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-15 12:06:21,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-15 12:06:21,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-15 12:06:21,941 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-15 12:06:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048449530] [2022-04-15 12:06:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048449530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:21,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752161803] [2022-04-15 12:06:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:06:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:21,943 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-15 12:06:21,943 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-15 12:06:22,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:06:22,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:22,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:06:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:22,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:22,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:06:22,484 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-15 12:06:22,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {18397#true} call ULTIMATE.init(); {18397#true} is VALID [2022-04-15 12:06:22,517 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-15 12:06:22,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-15 12:06:22,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-15 12:06:22,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-15 12:06:22,519 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-15 12:06:22,519 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-15 12:06:22,520 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-15 12:06:22,520 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-15 12:06:22,521 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-15 12:06:22,521 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-15 12:06:22,522 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-15 12:06:22,523 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-15 12:06:22,523 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-15 12:06:22,524 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-15 12:06:22,524 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-15 12:06:22,525 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-15 12:06:22,525 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-15 12:06:22,526 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-15 12:06:22,526 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-15 12:06:22,527 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-15 12:06:22,527 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-15 12:06:22,528 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-15 12:06:22,528 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-15 12:06:22,529 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-15 12:06:22,529 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-15 12:06:22,530 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-15 12:06:22,531 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-15 12:06:22,531 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-15 12:06:22,532 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-15 12:06:22,532 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-15 12:06:22,533 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-15 12:06:22,533 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-15 12:06:22,534 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-15 12:06:22,535 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-15 12:06:22,535 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-15 12:06:22,536 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-15 12:06:22,536 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-15 12:06:22,537 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-15 12:06:22,538 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-15 12:06:22,538 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-15 12:06:22,539 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-15 12:06:22,539 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-15 12:06:22,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-15 12:06:22,539 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-15 12:06:22,539 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-15 12:06:22,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-15 12:06:22,539 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-15 12:06:22,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-15 12:06:22,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-15 12:06:22,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-15 12:06:22,540 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-15 12:06:22,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:22,759 INFO L356 Elim1Store]: treesize reduction 29, result has 68.1 percent of original size [2022-04-15 12:06:22,759 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-15 12:06:23,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {18398#false} assume !false; {18398#false} is VALID [2022-04-15 12:06:23,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {18398#false} assume 0 == ~cond; {18398#false} is VALID [2022-04-15 12:06:23,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {18398#false} ~cond := #in~cond; {18398#false} is VALID [2022-04-15 12:06:23,002 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-15 12:06:23,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {18398#false} assume !(0 != #t~mem11);havoc #t~mem11; {18398#false} is VALID [2022-04-15 12:06:23,002 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-15 12:06:23,002 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-15 12:06:23,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {18398#false} assume !(~j~0 % 4294967296 < 2); {18398#false} is VALID [2022-04-15 12:06:23,002 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-15 12:06:23,003 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-15 12:06:23,003 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-15 12:06:23,004 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-15 12:06:23,004 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-15 12:06:23,005 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-15 12:06:23,005 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-15 12:06:23,006 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-15 12:06:23,006 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-15 12:06:23,006 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-15 12:06:23,007 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-15 12:06:23,007 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-15 12:06:23,007 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-15 12:06:23,008 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-15 12:06:23,008 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-15 12:06:23,009 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-15 12:06:23,009 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-15 12:06:23,009 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-15 12:06:23,010 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-15 12:06:23,010 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-15 12:06:23,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {18397#true} assume !(0 != #t~mem4);havoc #t~mem4; {18397#true} is VALID [2022-04-15 12:06:23,010 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-15 12:06:23,010 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-15 12:06:23,010 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-15 12:06:23,010 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-15 12:06:23,011 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-15 12:06:23,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {18397#true} assume !(~i~0 % 4294967296 < 5); {18397#true} is VALID [2022-04-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,011 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-15 12:06:23,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {18397#true} call #t~ret17 := main(); {18397#true} is VALID [2022-04-15 12:06:23,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18397#true} {18397#true} #133#return; {18397#true} is VALID [2022-04-15 12:06:23,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {18397#true} assume true; {18397#true} is VALID [2022-04-15 12:06:23,012 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-15 12:06:23,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {18397#true} call ULTIMATE.init(); {18397#true} is VALID [2022-04-15 12:06:23,012 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-15 12:06:23,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752161803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:23,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:23,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 31 [2022-04-15 12:06:23,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352038525] [2022-04-15 12:06:23,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352038525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:23,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:23,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:06:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307643311] [2022-04-15 12:06:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:23,015 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-15 12:06:23,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:23,015 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-15 12:06:23,054 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-15 12:06:23,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:06:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:06:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:06:23,056 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-15 12:06:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:31,376 INFO L93 Difference]: Finished difference Result 856 states and 1103 transitions. [2022-04-15 12:06:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:06:31,376 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-15 12:06:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:31,376 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-15 12:06:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 202 transitions. [2022-04-15 12:06:31,378 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-15 12:06:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 202 transitions. [2022-04-15 12:06:31,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 202 transitions. [2022-04-15 12:06:31,576 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-15 12:06:31,592 INFO L225 Difference]: With dead ends: 856 [2022-04-15 12:06:31,592 INFO L226 Difference]: Without dead ends: 670 [2022-04-15 12:06:31,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=642, Invalid=2550, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:06:31,594 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 244 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:06:31,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 72 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:06:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-04-15 12:06:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 357. [2022-04-15 12:06:34,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:34,419 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-15 12:06:34,420 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-15 12:06:34,420 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-15 12:06:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:34,442 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2022-04-15 12:06:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 852 transitions. [2022-04-15 12:06:34,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:34,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:34,444 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-15 12:06:34,444 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-15 12:06:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:34,467 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2022-04-15 12:06:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 852 transitions. [2022-04-15 12:06:34,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:34,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:34,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:34,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:34,469 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-15 12:06:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 458 transitions. [2022-04-15 12:06:34,478 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 458 transitions. Word has length 51 [2022-04-15 12:06:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:34,479 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 458 transitions. [2022-04-15 12:06:34,479 INFO L479 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-15 12:06:34,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 458 transitions. [2022-04-15 12:06:36,048 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-15 12:06:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 458 transitions. [2022-04-15 12:06:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:06:36,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:36,049 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:36,072 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-15 12:06:36,263 WARN L460 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-15 12:06:36,264 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -4715419, now seen corresponding path program 1 times [2022-04-15 12:06:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:36,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119872567] [2022-04-15 12:06:36,268 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:36,268 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash -4715419, now seen corresponding path program 2 times [2022-04-15 12:06:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:36,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037217922] [2022-04-15 12:06:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:36,842 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-15 12:06:36,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-15 12:06:36,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-15 12:06:36,842 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-15 12:06:36,842 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-15 12:06:36,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-15 12:06:36,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-15 12:06:36,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-15 12:06:36,844 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-15 12:06:36,844 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-15 12:06:36,845 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-15 12:06:36,845 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-15 12:06:36,845 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-15 12:06:36,846 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-15 12:06:36,846 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-15 12:06:36,847 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-15 12:06:36,847 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-15 12:06:36,848 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-15 12:06:36,848 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-15 12:06:36,848 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-15 12:06:36,849 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-15 12:06:36,849 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-15 12:06:36,850 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-15 12:06:36,850 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-15 12:06:36,850 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-15 12:06:36,851 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-15 12:06:36,851 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-15 12:06:36,852 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-15 12:06:36,852 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-15 12:06:36,853 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-15 12:06:36,853 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-15 12:06:36,854 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-15 12:06:36,854 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-15 12:06:36,855 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-15 12:06:36,855 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-15 12:06:36,856 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-15 12:06:36,856 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-15 12:06:36,857 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-15 12:06:36,857 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-15 12:06:36,858 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-15 12:06:36,859 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-15 12:06:36,859 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-15 12:06:36,859 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-15 12:06:36,859 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-15 12:06:36,860 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-15 12:06:36,860 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-15 12:06:36,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-15 12:06:36,860 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-15 12:06:36,860 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-15 12:06:36,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-15 12:06:36,860 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-15 12:06:36,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-15 12:06:36,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-15 12:06:36,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-15 12:06:36,861 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-15 12:06:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037217922] [2022-04-15 12:06:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037217922] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639691226] [2022-04-15 12:06:36,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:06:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:36,863 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-15 12:06:36,868 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-15 12:06:36,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:06:36,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:36,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:06:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:36,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:37,367 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-15 12:06:37,367 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-15 12:06:37,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {22554#true} call ULTIMATE.init(); {22554#true} is VALID [2022-04-15 12:06:37,419 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-15 12:06:37,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-15 12:06:37,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-15 12:06:37,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-15 12:06:37,420 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-15 12:06:37,421 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-15 12:06:37,421 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-15 12:06:37,422 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-15 12:06:37,422 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-15 12:06:37,423 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-15 12:06:37,423 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-15 12:06:37,424 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-15 12:06:37,424 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-15 12:06:37,425 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-15 12:06:37,425 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-15 12:06:37,426 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-15 12:06:37,426 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-15 12:06:37,427 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-15 12:06:37,427 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-15 12:06:37,428 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-15 12:06:37,428 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-15 12:06:37,428 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-15 12:06:37,429 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-15 12:06:37,429 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-15 12:06:37,430 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-15 12:06:37,431 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-15 12:06:37,431 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-15 12:06:37,432 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-15 12:06:37,432 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-15 12:06:37,433 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-15 12:06:37,433 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-15 12:06:37,434 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-15 12:06:37,434 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-15 12:06:37,435 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-15 12:06:37,435 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-15 12:06:37,436 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-15 12:06:37,437 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-15 12:06:37,437 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-15 12:06:37,437 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-15 12:06:37,438 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-15 12:06:37,438 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-15 12:06:37,438 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-15 12:06:37,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-15 12:06:37,438 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-15 12:06:37,438 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-15 12:06:37,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-15 12:06:37,438 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-15 12:06:37,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-15 12:06:37,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-15 12:06:37,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-15 12:06:37,439 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-15 12:06:37,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:37,673 INFO L356 Elim1Store]: treesize reduction 19, result has 77.6 percent of original size [2022-04-15 12:06:37,673 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-15 12:06:37,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {22555#false} assume !false; {22555#false} is VALID [2022-04-15 12:06:37,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {22555#false} assume 0 == ~cond; {22555#false} is VALID [2022-04-15 12:06:37,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {22555#false} ~cond := #in~cond; {22555#false} is VALID [2022-04-15 12:06:37,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-15 12:06:37,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {22555#false} assume !(0 != #t~mem11);havoc #t~mem11; {22555#false} is VALID [2022-04-15 12:06:37,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-15 12:06:37,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-15 12:06:37,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {22555#false} assume !(~j~0 % 4294967296 < 2); {22555#false} is VALID [2022-04-15 12:06:37,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-15 12:06:37,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-15 12:06:37,840 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-15 12:06:37,840 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-15 12:06:37,840 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-15 12:06:37,840 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-15 12:06:37,841 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-15 12:06:37,841 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-15 12:06:37,841 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-15 12:06:37,842 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-15 12:06:37,842 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-15 12:06:37,843 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-15 12:06:37,843 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-15 12:06:37,843 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-15 12:06:37,844 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-15 12:06:37,844 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-15 12:06:37,844 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-15 12:06:37,845 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-15 12:06:37,845 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-15 12:06:37,846 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-15 12:06:37,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {22554#true} assume !(0 != #t~mem4);havoc #t~mem4; {22554#true} is VALID [2022-04-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {22554#true} assume !(~i~0 % 4294967296 < 5); {22554#true} is VALID [2022-04-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,846 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-15 12:06:37,847 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-15 12:06:37,847 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-15 12:06:37,847 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-15 12:06:37,847 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-15 12:06:37,847 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-15 12:06:37,847 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-15 12:06:37,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {22554#true} call #t~ret17 := main(); {22554#true} is VALID [2022-04-15 12:06:37,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22554#true} {22554#true} #133#return; {22554#true} is VALID [2022-04-15 12:06:37,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {22554#true} assume true; {22554#true} is VALID [2022-04-15 12:06:37,847 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-15 12:06:37,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {22554#true} call ULTIMATE.init(); {22554#true} is VALID [2022-04-15 12:06:37,847 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-15 12:06:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639691226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:37,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:37,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 19 [2022-04-15 12:06:37,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:37,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119872567] [2022-04-15 12:06:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119872567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:37,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:37,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:06:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58375675] [2022-04-15 12:06:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:37,849 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-15 12:06:37,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:37,849 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-15 12:06:37,885 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-15 12:06:37,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:06:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:06:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:06:37,886 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-15 12:06:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:42,917 INFO L93 Difference]: Finished difference Result 579 states and 760 transitions. [2022-04-15 12:06:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:06:42,918 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-15 12:06:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:42,918 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-15 12:06:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 12:06:42,919 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-15 12:06:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 12:06:42,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-15 12:06:43,017 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-15 12:06:43,028 INFO L225 Difference]: With dead ends: 579 [2022-04-15 12:06:43,028 INFO L226 Difference]: Without dead ends: 535 [2022-04-15 12:06:43,029 INFO L912 BasicCegarLoop]: 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-15 12:06:43,029 INFO L913 BasicCegarLoop]: 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-15 12:06:43,030 INFO L914 BasicCegarLoop]: 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-15 12:06:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-04-15 12:06:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 367. [2022-04-15 12:06:45,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:06:45,959 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-15 12:06:45,959 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-15 12:06:45,959 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-15 12:06:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:45,974 INFO L93 Difference]: Finished difference Result 535 states and 702 transitions. [2022-04-15 12:06:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 702 transitions. [2022-04-15 12:06:45,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:45,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:45,975 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-15 12:06:45,976 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-15 12:06:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:45,987 INFO L93 Difference]: Finished difference Result 535 states and 702 transitions. [2022-04-15 12:06:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 702 transitions. [2022-04-15 12:06:45,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:06:45,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:06:45,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:06:45,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:06:45,989 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-15 12:06:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 468 transitions. [2022-04-15 12:06:45,999 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 468 transitions. Word has length 51 [2022-04-15 12:06:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:06:45,999 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 468 transitions. [2022-04-15 12:06:45,999 INFO L479 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-15 12:06:45,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 468 transitions. [2022-04-15 12:06:47,580 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-15 12:06:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 468 transitions. [2022-04-15 12:06:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:06:47,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:06:47,581 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:06:47,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:06:47,782 WARN L460 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-15 12:06:47,782 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:06:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:06:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash -198494423, now seen corresponding path program 3 times [2022-04-15 12:06:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:47,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575072917] [2022-04-15 12:06:47,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:06:47,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:06:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash -198494423, now seen corresponding path program 4 times [2022-04-15 12:06:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:06:47,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438083510] [2022-04-15 12:06:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:06:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:06:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:06:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:48,365 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-15 12:06:48,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-15 12:06:48,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-15 12:06:48,366 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-15 12:06:48,366 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-15 12:06:48,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-15 12:06:48,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-15 12:06:48,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-15 12:06:48,367 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-15 12:06:48,368 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-15 12:06:48,368 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-15 12:06:48,369 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-15 12:06:48,369 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-15 12:06:48,370 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-15 12:06:48,370 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-15 12:06:48,371 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-15 12:06:48,371 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-15 12:06:48,372 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-15 12:06:48,372 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-15 12:06:48,373 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-15 12:06:48,373 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-15 12:06:48,374 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-15 12:06:48,374 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-15 12:06:48,375 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-15 12:06:48,375 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-15 12:06:48,375 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-15 12:06:48,376 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-15 12:06:48,376 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-15 12:06:48,377 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-15 12:06:48,377 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-15 12:06:48,378 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-15 12:06:48,379 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-15 12:06:48,380 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-15 12:06:48,380 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-15 12:06:48,381 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-15 12:06:48,381 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-15 12:06:48,381 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-15 12:06:48,382 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-15 12:06:48,382 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-15 12:06:48,383 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-15 12:06:48,383 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-15 12:06:48,384 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-15 12:06:48,384 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-15 12:06:48,385 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-15 12:06:48,386 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-15 12:06:48,386 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-15 12:06:48,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-15 12:06:48,386 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-15 12:06:48,386 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-15 12:06:48,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-15 12:06:48,386 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-15 12:06:48,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-15 12:06:48,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-15 12:06:48,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-15 12:06:48,386 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-15 12:06:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:06:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438083510] [2022-04-15 12:06:48,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438083510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:06:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988835876] [2022-04-15 12:06:48,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:06:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:06:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:06:48,388 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-15 12:06:48,389 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-15 12:06:48,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:06:48,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:06:48,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:06:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:06:48,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:06:48,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:06:48,879 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-15 12:06:48,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {25859#true} call ULTIMATE.init(); {25859#true} is VALID [2022-04-15 12:06:48,905 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-15 12:06:48,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-15 12:06:48,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-15 12:06:48,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-15 12:06:48,907 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-15 12:06:48,907 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-15 12:06:48,908 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-15 12:06:48,908 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-15 12:06:48,908 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-15 12:06:48,909 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-15 12:06:48,909 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-15 12:06:48,910 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-15 12:06:48,910 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-15 12:06:48,910 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-15 12:06:48,911 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-15 12:06:48,911 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-15 12:06:48,911 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-15 12:06:48,912 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-15 12:06:48,912 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-15 12:06:48,912 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-15 12:06:48,913 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-15 12:06:48,913 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-15 12:06:48,914 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-15 12:06:48,914 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-15 12:06:48,914 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-15 12:06:48,915 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-15 12:06:48,915 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-15 12:06:48,916 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-15 12:06:48,916 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-15 12:06:48,916 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-15 12:06:48,917 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-15 12:06:48,917 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-15 12:06:48,918 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-15 12:06:48,918 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-15 12:06:48,919 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-15 12:06:48,919 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-15 12:06:48,920 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-15 12:06:48,920 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-15 12:06:48,921 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-15 12:06:48,921 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-15 12:06:48,921 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-15 12:06:48,921 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-15 12:06:48,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-15 12:06:48,922 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-15 12:06:48,922 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-15 12:06:48,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-15 12:06:48,922 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-15 12:06:48,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-15 12:06:48,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-15 12:06:48,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-15 12:06:48,922 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-15 12:06:48,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:06:53,258 INFO L356 Elim1Store]: treesize reduction 23, result has 76.3 percent of original size [2022-04-15 12:06:53,259 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-15 12:06:53,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {25860#false} assume !false; {25860#false} is VALID [2022-04-15 12:06:53,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {25860#false} assume 0 == ~cond; {25860#false} is VALID [2022-04-15 12:06:53,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {25860#false} ~cond := #in~cond; {25860#false} is VALID [2022-04-15 12:06:53,448 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-15 12:06:53,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {25860#false} assume !(0 != #t~mem11);havoc #t~mem11; {25860#false} is VALID [2022-04-15 12:06:53,448 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-15 12:06:53,448 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-15 12:06:53,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {25860#false} assume !(~j~0 % 4294967296 < 2); {25860#false} is VALID [2022-04-15 12:06:53,449 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-15 12:06:53,449 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-15 12:06:53,450 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-15 12:06:53,450 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-15 12:06:53,451 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-15 12:06:53,451 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-15 12:06:53,452 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-15 12:06:53,452 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-15 12:06:53,452 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-15 12:06:53,453 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-15 12:06:53,453 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-15 12:06:53,453 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-15 12:06:53,453 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-15 12:06:53,454 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-15 12:06:53,455 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-15 12:06:53,456 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-15 12:06:53,456 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-15 12:06:53,457 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-15 12:06:53,457 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-15 12:06:53,457 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-15 12:06:53,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {25859#true} assume !(0 != #t~mem4);havoc #t~mem4; {25859#true} is VALID [2022-04-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {25859#true} assume !(~i~0 % 4294967296 < 5); {25859#true} is VALID [2022-04-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,458 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-15 12:06:53,459 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-15 12:06:53,459 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-15 12:06:53,459 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-15 12:06:53,459 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-15 12:06:53,459 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-15 12:06:53,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {25859#true} call #t~ret17 := main(); {25859#true} is VALID [2022-04-15 12:06:53,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25859#true} {25859#true} #133#return; {25859#true} is VALID [2022-04-15 12:06:53,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {25859#true} assume true; {25859#true} is VALID [2022-04-15 12:06:53,459 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-15 12:06:53,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {25859#true} call ULTIMATE.init(); {25859#true} is VALID [2022-04-15 12:06:53,459 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-15 12:06:53,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988835876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:06:53,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:06:53,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 27 [2022-04-15 12:06:53,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:06:53,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575072917] [2022-04-15 12:06:53,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575072917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:06:53,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:06:53,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:06:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367712640] [2022-04-15 12:06:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:06:53,461 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-15 12:06:53,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:06:53,461 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-15 12:06:53,492 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-15 12:06:53,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:06:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:06:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:06:53,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=563, Unknown=8, NotChecked=0, Total=702 [2022-04-15 12:06:53,493 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-15 12:06:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:06:59,025 INFO L93 Difference]: Finished difference Result 765 states and 982 transitions. [2022-04-15 12:06:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:06:59,025 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-15 12:06:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:06:59,025 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-15 12:06:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2022-04-15 12:06:59,026 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-15 12:06:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 128 transitions. [2022-04-15 12:06:59,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 128 transitions. [2022-04-15 12:06:59,130 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-15 12:06:59,144 INFO L225 Difference]: With dead ends: 765 [2022-04-15 12:06:59,144 INFO L226 Difference]: Without dead ends: 496 [2022-04-15 12:06:59,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=321, Invalid=1231, Unknown=8, NotChecked=0, Total=1560 [2022-04-15 12:06:59,145 INFO L913 BasicCegarLoop]: 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-15 12:06:59,146 INFO L914 BasicCegarLoop]: 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-15 12:06:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-15 12:07:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 394. [2022-04-15 12:07:02,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:02,373 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-15 12:07:02,373 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-15 12:07:02,374 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-15 12:07:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:02,386 INFO L93 Difference]: Finished difference Result 496 states and 629 transitions. [2022-04-15 12:07:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2022-04-15 12:07:02,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:02,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:02,388 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-15 12:07:02,388 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-15 12:07:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:02,401 INFO L93 Difference]: Finished difference Result 496 states and 629 transitions. [2022-04-15 12:07:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 629 transitions. [2022-04-15 12:07:02,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:02,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:02,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:02,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:02,403 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-15 12:07:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2022-04-15 12:07:02,414 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 51 [2022-04-15 12:07:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:02,414 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2022-04-15 12:07:02,414 INFO L479 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-15 12:07:02,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 394 states and 500 transitions. [2022-04-15 12:07:04,151 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-15 12:07:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2022-04-15 12:07:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:07:04,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:04,152 INFO L499 BasicCegarLoop]: 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-15 12:07:04,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:07:04,369 WARN L460 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-15 12:07:04,370 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2072849753, now seen corresponding path program 1 times [2022-04-15 12:07:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:04,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291251319] [2022-04-15 12:07:04,375 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:04,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2072849753, now seen corresponding path program 2 times [2022-04-15 12:07:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:04,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58392849] [2022-04-15 12:07:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:04,446 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-15 12:07:04,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-15 12:07:04,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-15 12:07:04,446 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-15 12:07:04,447 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-15 12:07:04,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-15 12:07:04,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-15 12:07:04,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-15 12:07:04,447 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-15 12:07:04,447 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-15 12:07:04,447 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-15 12:07:04,447 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-15 12:07:04,447 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,448 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-15 12:07:04,449 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-15 12:07:04,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-15 12:07:04,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,449 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-15 12:07:04,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {29530#true} assume !(~j~0 % 4294967296 < 2); {29530#true} is VALID [2022-04-15 12:07:04,450 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-15 12:07:04,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-15 12:07:04,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-15 12:07:04,450 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-15 12:07:04,450 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-15 12:07:04,451 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-15 12:07:04,451 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-15 12:07:04,451 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-15 12:07:04,452 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-15 12:07:04,452 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-15 12:07:04,453 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-15 12:07:04,453 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-15 12:07:04,454 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-15 12:07:04,454 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-15 12:07:04,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-15 12:07:04,454 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-15 12:07:04,454 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-15 12:07:04,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-15 12:07:04,454 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-15 12:07:04,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-15 12:07:04,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-15 12:07:04,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-15 12:07:04,455 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-15 12:07:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58392849] [2022-04-15 12:07:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58392849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38371230] [2022-04-15 12:07:04,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:07:04,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:04,460 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-15 12:07:04,464 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-15 12:07:04,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:07:04,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:04,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:07:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:04,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:04,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {29530#true} call ULTIMATE.init(); {29530#true} is VALID [2022-04-15 12:07:04,926 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-15 12:07:04,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-15 12:07:04,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-15 12:07:04,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-15 12:07:04,927 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-15 12:07:04,927 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-15 12:07:04,928 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-15 12:07:04,928 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-15 12:07:04,928 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-15 12:07:04,928 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-15 12:07:04,928 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-15 12:07:04,928 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-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 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-15 12:07:04,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-15 12:07:04,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-15 12:07:04,930 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-15 12:07:04,930 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-15 12:07:04,931 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-15 12:07:04,931 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-15 12:07:04,932 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-15 12:07:04,932 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-15 12:07:04,933 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-15 12:07:04,933 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-15 12:07:04,933 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-15 12:07:04,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-15 12:07:04,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-15 12:07:04,933 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-15 12:07:04,934 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-15 12:07:04,934 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-15 12:07:04,934 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-15 12:07:04,935 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-15 12:07:04,935 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-15 12:07:04,936 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-15 12:07:04,936 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-15 12:07:04,937 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-15 12:07:04,937 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-15 12:07:04,937 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-15 12:07:04,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-15 12:07:04,938 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-15 12:07:04,938 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-15 12:07:04,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-15 12:07:04,938 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-15 12:07:04,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-15 12:07:04,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-15 12:07:04,938 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-15 12:07:04,938 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-15 12:07:04,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:05,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {29531#false} assume !false; {29531#false} is VALID [2022-04-15 12:07:05,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {29531#false} assume 0 == ~cond; {29531#false} is VALID [2022-04-15 12:07:05,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {29531#false} ~cond := #in~cond; {29531#false} is VALID [2022-04-15 12:07:05,080 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-15 12:07:05,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {29531#false} assume !(0 != #t~mem11);havoc #t~mem11; {29531#false} is VALID [2022-04-15 12:07:05,081 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-15 12:07:05,081 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-15 12:07:05,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {29531#false} assume !(~j~0 % 4294967296 < 2); {29531#false} is VALID [2022-04-15 12:07:05,081 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-15 12:07:05,081 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-15 12:07:05,081 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-15 12:07:05,082 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-15 12:07:05,082 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-15 12:07:05,082 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-15 12:07:05,083 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-15 12:07:05,083 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-15 12:07:05,084 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-15 12:07:05,084 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-15 12:07:05,084 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-15 12:07:05,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {29530#true} ~i~0 := 0;~cont_aux~0 := 0; {29530#true} is VALID [2022-04-15 12:07:05,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {29530#true} is VALID [2022-04-15 12:07:05,085 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-15 12:07:05,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {29530#true} assume !(~j~0 % 4294967296 < 2); {29530#true} is VALID [2022-04-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {29530#true} ~cont~0 := 0;~i~0 := 0; {29530#true} is VALID [2022-04-15 12:07:05,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {29530#true} assume !(0 != #t~mem4);havoc #t~mem4; {29530#true} is VALID [2022-04-15 12:07:05,085 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-15 12:07:05,085 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {29530#true} assume !(~i~0 % 4294967296 < 5); {29530#true} is VALID [2022-04-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,086 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-15 12:07:05,093 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-15 12:07:05,093 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-15 12:07:05,093 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-15 12:07:05,093 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-15 12:07:05,094 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-15 12:07:05,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {29530#true} call #t~ret17 := main(); {29530#true} is VALID [2022-04-15 12:07:05,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29530#true} {29530#true} #133#return; {29530#true} is VALID [2022-04-15 12:07:05,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {29530#true} assume true; {29530#true} is VALID [2022-04-15 12:07:05,094 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-15 12:07:05,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {29530#true} call ULTIMATE.init(); {29530#true} is VALID [2022-04-15 12:07:05,094 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-15 12:07:05,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38371230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:05,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:05,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2022-04-15 12:07:05,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:05,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291251319] [2022-04-15 12:07:05,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291251319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:05,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:05,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:07:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752488506] [2022-04-15 12:07:05,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:05,096 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-15 12:07:05,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:05,096 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-15 12:07:05,123 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-15 12:07:05,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:07:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:07:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:07:05,124 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-15 12:07:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:08,606 INFO L93 Difference]: Finished difference Result 733 states and 928 transitions. [2022-04-15 12:07:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:07:08,606 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-15 12:07:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:07:08,606 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-15 12:07:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 12:07:08,607 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-15 12:07:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 12:07:08,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-15 12:07:08,655 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-15 12:07:08,664 INFO L225 Difference]: With dead ends: 733 [2022-04-15 12:07:08,664 INFO L226 Difference]: Without dead ends: 382 [2022-04-15 12:07:08,665 INFO L912 BasicCegarLoop]: 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-15 12:07:08,665 INFO L913 BasicCegarLoop]: 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-15 12:07:08,666 INFO L914 BasicCegarLoop]: 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-15 12:07:08,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-15 12:07:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 354. [2022-04-15 12:07:11,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:11,611 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-15 12:07:11,611 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-15 12:07:11,611 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-15 12:07:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:11,616 INFO L93 Difference]: Finished difference Result 382 states and 446 transitions. [2022-04-15 12:07:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2022-04-15 12:07:11,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:11,617 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-15 12:07:11,618 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-15 12:07:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:11,625 INFO L93 Difference]: Finished difference Result 382 states and 446 transitions. [2022-04-15 12:07:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2022-04-15 12:07:11,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:11,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:11,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:11,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:11,627 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-15 12:07:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 418 transitions. [2022-04-15 12:07:11,635 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 418 transitions. Word has length 54 [2022-04-15 12:07:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:11,635 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 418 transitions. [2022-04-15 12:07:11,636 INFO L479 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-15 12:07:11,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 354 states and 418 transitions. [2022-04-15 12:07:13,140 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-15 12:07:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 418 transitions. [2022-04-15 12:07:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 12:07:13,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:13,141 INFO L499 BasicCegarLoop]: 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-15 12:07:13,158 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-15 12:07:13,341 WARN L460 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-15 12:07:13,342 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1813405083, now seen corresponding path program 3 times [2022-04-15 12:07:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:13,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436968600] [2022-04-15 12:07:13,346 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:13,346 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1813405083, now seen corresponding path program 4 times [2022-04-15 12:07:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:13,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228072524] [2022-04-15 12:07:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:13,458 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-15 12:07:13,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-15 12:07:13,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-15 12:07:13,459 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-15 12:07:13,459 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-15 12:07:13,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-15 12:07:13,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-15 12:07:13,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-15 12:07:13,459 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-15 12:07:13,459 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 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-15 12:07:13,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {32815#true} assume !(~i~0 % 4294967296 < 5); {32815#true} is VALID [2022-04-15 12:07:13,460 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-15 12:07:13,461 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-15 12:07:13,461 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-15 12:07:13,462 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-15 12:07:13,462 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-15 12:07:13,463 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-15 12:07:13,463 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-15 12:07:13,464 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-15 12:07:13,464 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-15 12:07:13,465 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-15 12:07:13,465 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-15 12:07:13,466 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-15 12:07:13,466 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-15 12:07:13,467 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-15 12:07:13,467 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-15 12:07:13,468 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,469 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-15 12:07:13,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {32816#false} assume !(~j~0 % 4294967296 < 2); {32816#false} is VALID [2022-04-15 12:07:13,470 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-15 12:07:13,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {32816#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {32816#false} is VALID [2022-04-15 12:07:13,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {32816#false} ~i~0 := 0;~cont_aux~0 := 0; {32816#false} is VALID [2022-04-15 12:07:13,470 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-15 12:07:13,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {32816#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {32816#false} is VALID [2022-04-15 12:07:13,470 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-15 12:07:13,470 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-15 12:07:13,470 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-15 12:07:13,470 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-15 12:07:13,471 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-15 12:07:13,471 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-15 12:07:13,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {32816#false} assume !(~j~0 % 4294967296 < 2); {32816#false} is VALID [2022-04-15 12:07:13,471 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-15 12:07:13,471 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-15 12:07:13,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {32816#false} assume !(0 != #t~mem11);havoc #t~mem11; {32816#false} is VALID [2022-04-15 12:07:13,471 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-15 12:07:13,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-15 12:07:13,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-15 12:07:13,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-15 12:07:13,472 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-15 12:07:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228072524] [2022-04-15 12:07:13,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228072524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786011217] [2022-04-15 12:07:13,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:07:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:13,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:13,476 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-15 12:07:13,502 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-15 12:07:13,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:07:13,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:13,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 12:07:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:13,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:14,592 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 12:07:14,592 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-15 12:07:14,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {32815#true} call ULTIMATE.init(); {32815#true} is VALID [2022-04-15 12:07:14,615 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-15 12:07:14,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-15 12:07:14,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-15 12:07:14,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-15 12:07:14,616 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-15 12:07:14,617 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-15 12:07:14,617 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-15 12:07:14,618 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-15 12:07:14,618 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-15 12:07:14,619 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-15 12:07:14,619 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-15 12:07:14,620 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-15 12:07:14,620 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-15 12:07:14,620 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-15 12:07:14,621 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-15 12:07:14,621 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-15 12:07:14,622 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-15 12:07:14,622 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-15 12:07:14,623 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-15 12:07:14,623 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-15 12:07:14,623 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-15 12:07:14,624 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-15 12:07:14,624 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-15 12:07:14,625 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-15 12:07:14,625 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-15 12:07:14,626 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-15 12:07:14,626 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-15 12:07:14,627 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-15 12:07:14,627 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-15 12:07:14,628 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-15 12:07:14,628 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-15 12:07:14,629 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-15 12:07:14,629 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-15 12:07:14,630 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-15 12:07:14,630 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-15 12:07:14,631 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-15 12:07:14,631 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-15 12:07:14,632 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-15 12:07:14,632 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-15 12:07:14,633 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-15 12:07:14,633 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-15 12:07:14,634 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-15 12:07:14,634 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-15 12:07:14,635 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-15 12:07:14,635 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-15 12:07:14,636 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-15 12:07:14,637 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-15 12:07:14,638 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-15 12:07:14,639 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-15 12:07:14,640 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-15 12:07:14,641 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-15 12:07:14,642 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-15 12:07:14,642 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-15 12:07:14,643 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-15 12:07:14,643 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-15 12:07:14,643 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-15 12:07:14,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-15 12:07:14,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-15 12:07:14,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-15 12:07:14,645 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-15 12:07:14,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:18,333 INFO L356 Elim1Store]: treesize reduction 54, result has 28.9 percent of original size [2022-04-15 12:07:18,334 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-15 12:07:18,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {32816#false} assume !false; {32816#false} is VALID [2022-04-15 12:07:18,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {32816#false} assume 0 == ~cond; {32816#false} is VALID [2022-04-15 12:07:18,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {32816#false} ~cond := #in~cond; {32816#false} is VALID [2022-04-15 12:07:18,409 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-15 12:07:18,414 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-15 12:07:18,414 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-15 12:07:18,415 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-15 12:07:18,415 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-15 12:07:18,416 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-15 12:07:18,416 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-15 12:07:18,417 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-15 12:07:18,417 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-15 12:07:18,417 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-15 12:07:18,418 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-15 12:07:18,418 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-15 12:07:18,419 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-15 12:07:18,419 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-15 12:07:18,420 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-15 12:07:18,420 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-15 12:07:18,420 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-15 12:07:18,421 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-15 12:07:18,421 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-15 12:07:18,422 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-15 12:07:18,422 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-15 12:07:18,423 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-15 12:07:18,423 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-15 12:07:18,424 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-15 12:07:18,425 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-15 12:07:18,425 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-15 12:07:18,426 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-15 12:07:18,426 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-15 12:07:18,427 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-15 12:07:18,427 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-15 12:07:18,428 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-15 12:07:18,429 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-15 12:07:18,429 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-15 12:07:18,430 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-15 12:07:18,430 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-15 12:07:18,431 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-15 12:07:18,431 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-15 12:07:18,432 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-15 12:07:18,432 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-15 12:07:18,432 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-15 12:07:18,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {32815#true} assume !(~i~0 % 4294967296 < 5); {32815#true} is VALID [2022-04-15 12:07:18,432 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 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-15 12:07:18,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {32815#true} call #t~ret17 := main(); {32815#true} is VALID [2022-04-15 12:07:18,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32815#true} {32815#true} #133#return; {32815#true} is VALID [2022-04-15 12:07:18,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {32815#true} assume true; {32815#true} is VALID [2022-04-15 12:07:18,433 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-15 12:07:18,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {32815#true} call ULTIMATE.init(); {32815#true} is VALID [2022-04-15 12:07:18,434 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-15 12:07:18,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786011217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:18,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:18,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 37 [2022-04-15 12:07:18,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436968600] [2022-04-15 12:07:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436968600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:18,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:18,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:07:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488394721] [2022-04-15 12:07:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:18,435 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-15 12:07:18,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:18,436 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-15 12:07:18,464 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-15 12:07:18,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:07:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:07:18,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1153, Unknown=5, NotChecked=0, Total=1332 [2022-04-15 12:07:18,465 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-15 12:07:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:21,882 INFO L93 Difference]: Finished difference Result 537 states and 620 transitions. [2022-04-15 12:07:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:07:21,882 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-15 12:07:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:07:21,883 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-15 12:07:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-15 12:07:21,883 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-15 12:07:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-15 12:07:21,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-15 12:07:21,969 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-15 12:07:21,974 INFO L225 Difference]: With dead ends: 537 [2022-04-15 12:07:21,974 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 12:07:21,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=202, Invalid=1433, Unknown=5, NotChecked=0, Total=1640 [2022-04-15 12:07:21,975 INFO L913 BasicCegarLoop]: 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-15 12:07:21,975 INFO L914 BasicCegarLoop]: 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-15 12:07:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 12:07:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 284. [2022-04-15 12:07:24,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:24,337 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-15 12:07:24,337 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-15 12:07:24,337 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-15 12:07:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:24,342 INFO L93 Difference]: Finished difference Result 348 states and 402 transitions. [2022-04-15 12:07:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 402 transitions. [2022-04-15 12:07:24,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:24,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:24,342 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-15 12:07:24,342 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-15 12:07:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:24,349 INFO L93 Difference]: Finished difference Result 348 states and 402 transitions. [2022-04-15 12:07:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 402 transitions. [2022-04-15 12:07:24,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:24,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:24,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:24,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:24,350 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-15 12:07:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 331 transitions. [2022-04-15 12:07:24,356 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 331 transitions. Word has length 60 [2022-04-15 12:07:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:24,356 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 331 transitions. [2022-04-15 12:07:24,357 INFO L479 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-15 12:07:24,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 284 states and 331 transitions. [2022-04-15 12:07:25,548 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-15 12:07:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 331 transitions. [2022-04-15 12:07:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:07:25,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:25,549 INFO L499 BasicCegarLoop]: 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-15 12:07:25,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 12:07:25,751 WARN L460 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-15 12:07:25,751 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1971018387, now seen corresponding path program 5 times [2022-04-15 12:07:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:25,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617671035] [2022-04-15 12:07:25,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:25,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1971018387, now seen corresponding path program 6 times [2022-04-15 12:07:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:25,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486255188] [2022-04-15 12:07:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:26,131 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-15 12:07:26,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-15 12:07:26,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-15 12:07:26,132 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-15 12:07:26,132 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-15 12:07:26,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-15 12:07:26,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-15 12:07:26,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-15 12:07:26,133 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-15 12:07:26,133 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-15 12:07:26,133 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-15 12:07:26,134 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-15 12:07:26,134 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-15 12:07:26,134 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-15 12:07:26,135 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-15 12:07:26,135 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-15 12:07:26,135 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-15 12:07:26,136 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-15 12:07:26,136 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-15 12:07:26,137 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-15 12:07:26,137 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-15 12:07:26,137 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-15 12:07:26,138 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-15 12:07:26,138 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-15 12:07:26,139 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-15 12:07:26,140 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-15 12:07:26,141 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-15 12:07:26,142 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-15 12:07:26,142 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-15 12:07:26,143 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-15 12:07:26,143 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-15 12:07:26,144 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-15 12:07:26,145 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-15 12:07:26,145 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-15 12:07:26,146 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-15 12:07:26,147 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-15 12:07:26,147 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-15 12:07:26,148 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-15 12:07:26,148 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-15 12:07:26,149 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-15 12:07:26,149 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-15 12:07:26,150 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-15 12:07:26,150 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-15 12:07:26,151 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-15 12:07:26,151 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-15 12:07:26,152 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-15 12:07:26,152 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-15 12:07:26,153 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-15 12:07:26,154 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-15 12:07:26,154 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-15 12:07:26,154 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-15 12:07:26,154 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-15 12:07:26,154 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-15 12:07:26,154 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-15 12:07:26,155 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-15 12:07:26,155 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-15 12:07:26,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-15 12:07:26,155 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-15 12:07:26,155 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-15 12:07:26,155 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-15 12:07:26,155 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-15 12:07:26,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-15 12:07:26,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-15 12:07:26,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-15 12:07:26,156 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-15 12:07:26,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:26,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486255188] [2022-04-15 12:07:26,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486255188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:26,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609983818] [2022-04-15 12:07:26,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:07:26,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:26,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:26,158 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-15 12:07:26,159 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-15 12:07:26,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:07:26,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:26,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 12:07:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:26,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:26,544 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-15 12:07:26,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {35560#true} call ULTIMATE.init(); {35560#true} is VALID [2022-04-15 12:07:26,572 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-15 12:07:26,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-15 12:07:26,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-15 12:07:26,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-15 12:07:26,572 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-15 12:07:26,572 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-15 12:07:26,573 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-15 12:07:26,573 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-15 12:07:26,573 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-15 12:07:26,574 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-15 12:07:26,574 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-15 12:07:26,574 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-15 12:07:26,574 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-15 12:07:26,575 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-15 12:07:26,575 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-15 12:07:26,575 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-15 12:07:26,576 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-15 12:07:26,576 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-15 12:07:26,576 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-15 12:07:26,577 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-15 12:07:26,577 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-15 12:07:26,577 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-15 12:07:26,578 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-15 12:07:26,578 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-15 12:07:26,579 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-15 12:07:26,579 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-15 12:07:26,579 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-15 12:07:26,580 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-15 12:07:26,580 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-15 12:07:26,581 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-15 12:07:26,581 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-15 12:07:26,581 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-15 12:07:26,582 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-15 12:07:26,582 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-15 12:07:26,582 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-15 12:07:26,583 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-15 12:07:26,583 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-15 12:07:26,584 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-15 12:07:26,584 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-15 12:07:26,585 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-15 12:07:26,585 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-15 12:07:26,585 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-15 12:07:26,586 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-15 12:07:26,586 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-15 12:07:26,586 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-15 12:07:26,587 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-15 12:07:26,587 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-15 12:07:26,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-15 12:07:26,587 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-15 12:07:26,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-15 12:07:26,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-15 12:07:26,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-15 12:07:26,588 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-15 12:07:26,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:26,765 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:07:26,765 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-15 12:07:26,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {35561#false} assume !false; {35561#false} is VALID [2022-04-15 12:07:26,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {35561#false} assume 0 == ~cond; {35561#false} is VALID [2022-04-15 12:07:26,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {35561#false} ~cond := #in~cond; {35561#false} is VALID [2022-04-15 12:07:26,839 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-15 12:07:26,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {35561#false} assume !(0 != #t~mem11);havoc #t~mem11; {35561#false} is VALID [2022-04-15 12:07:26,839 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-15 12:07:26,839 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-15 12:07:26,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {35561#false} assume !(~j~0 % 4294967296 < 2); {35561#false} is VALID [2022-04-15 12:07:26,839 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-15 12:07:26,839 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-15 12:07:26,839 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-15 12:07:26,839 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-15 12:07:26,840 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-15 12:07:26,840 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-15 12:07:26,840 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-15 12:07:26,840 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-15 12:07:26,841 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-15 12:07:26,841 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-15 12:07:26,842 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-15 12:07:26,842 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-15 12:07:26,842 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-15 12:07:26,843 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-15 12:07:26,843 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-15 12:07:26,844 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-15 12:07:26,844 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-15 12:07:26,844 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-15 12:07:26,845 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-15 12:07:26,845 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-15 12:07:26,845 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-15 12:07:26,846 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-15 12:07:26,846 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-15 12:07:26,846 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-15 12:07:26,846 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-15 12:07:26,847 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-15 12:07:26,847 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-15 12:07:26,847 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-15 12:07:26,848 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-15 12:07:26,848 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-15 12:07:26,848 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-15 12:07:26,849 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-15 12:07:26,849 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-15 12:07:26,849 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {35560#true} assume !(~i~0 % 4294967296 < 5); {35560#true} is VALID [2022-04-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,850 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-15 12:07:26,851 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-15 12:07:26,851 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-15 12:07:26,851 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-15 12:07:26,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {35560#true} call #t~ret17 := main(); {35560#true} is VALID [2022-04-15 12:07:26,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35560#true} {35560#true} #133#return; {35560#true} is VALID [2022-04-15 12:07:26,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {35560#true} assume true; {35560#true} is VALID [2022-04-15 12:07:26,851 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-15 12:07:26,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {35560#true} call ULTIMATE.init(); {35560#true} is VALID [2022-04-15 12:07:26,851 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-15 12:07:26,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609983818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:26,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:26,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 23 [2022-04-15 12:07:26,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:26,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617671035] [2022-04-15 12:07:26,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617671035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:26,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:26,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:07:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19132717] [2022-04-15 12:07:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:26,853 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-15 12:07:26,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:26,853 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-15 12:07:26,892 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-15 12:07:26,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:07:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:07:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:07:26,893 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-15 12:07:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:30,279 INFO L93 Difference]: Finished difference Result 338 states and 389 transitions. [2022-04-15 12:07:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:07:30,279 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-15 12:07:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:07:30,279 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-15 12:07:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 12:07:30,280 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-15 12:07:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 12:07:30,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-15 12:07:30,342 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-15 12:07:30,345 INFO L225 Difference]: With dead ends: 338 [2022-04-15 12:07:30,345 INFO L226 Difference]: Without dead ends: 262 [2022-04-15 12:07:30,345 INFO L912 BasicCegarLoop]: 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-15 12:07:30,346 INFO L913 BasicCegarLoop]: 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-15 12:07:30,346 INFO L914 BasicCegarLoop]: 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-15 12:07:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-15 12:07:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-04-15 12:07:32,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:32,608 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-15 12:07:32,609 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-15 12:07:32,609 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-15 12:07:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:32,612 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2022-04-15 12:07:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-15 12:07:32,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:32,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:32,612 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-15 12:07:32,613 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-15 12:07:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:32,617 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2022-04-15 12:07:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-15 12:07:32,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:32,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:32,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:32,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:32,618 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-15 12:07:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2022-04-15 12:07:32,623 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 61 [2022-04-15 12:07:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:32,623 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2022-04-15 12:07:32,623 INFO L479 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-15 12:07:32,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 306 transitions. [2022-04-15 12:07:33,734 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-15 12:07:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2022-04-15 12:07:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:07:33,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:33,735 INFO L499 BasicCegarLoop]: 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-15 12:07:33,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:07:33,935 WARN L460 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-15 12:07:33,935 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash -891810688, now seen corresponding path program 7 times [2022-04-15 12:07:33,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:33,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734539348] [2022-04-15 12:07:33,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:33,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -891810688, now seen corresponding path program 8 times [2022-04-15 12:07:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:33,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786343180] [2022-04-15 12:07:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:33,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:34,760 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-15 12:07:34,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-15 12:07:34,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-15 12:07:34,760 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-15 12:07:34,760 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-15 12:07:34,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-15 12:07:34,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-15 12:07:34,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-15 12:07:34,761 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-15 12:07:34,762 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-15 12:07:34,762 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-15 12:07:34,763 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-15 12:07:34,763 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-15 12:07:34,763 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-15 12:07:34,764 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-15 12:07:34,764 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-15 12:07:34,765 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-15 12:07:34,765 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-15 12:07:34,765 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-15 12:07:34,766 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-15 12:07:34,766 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-15 12:07:34,766 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-15 12:07:34,767 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-15 12:07:34,767 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-15 12:07:34,768 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-15 12:07:34,768 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-15 12:07:34,769 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-15 12:07:34,769 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-15 12:07:34,770 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-15 12:07:34,770 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-15 12:07:34,770 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-15 12:07:34,771 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-15 12:07:34,771 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-15 12:07:34,772 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-15 12:07:34,772 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-15 12:07:34,773 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-15 12:07:34,773 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-15 12:07:34,774 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-15 12:07:34,774 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-15 12:07:34,775 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-15 12:07:34,776 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-15 12:07:34,776 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-15 12:07:34,777 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-15 12:07:34,777 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-15 12:07:34,778 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-15 12:07:34,778 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-15 12:07:34,779 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-15 12:07:34,779 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-15 12:07:34,780 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-15 12:07:34,780 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-15 12:07:34,781 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-15 12:07:34,782 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-15 12:07:34,782 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-15 12:07:34,783 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-15 12:07:34,783 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-15 12:07:34,783 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-15 12:07:34,784 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-15 12:07:34,784 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-15 12:07:34,785 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-15 12:07:34,785 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-15 12:07:34,785 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-15 12:07:34,786 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-15 12:07:34,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-15 12:07:34,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-15 12:07:34,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-15 12:07:34,786 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-15 12:07:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:34,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786343180] [2022-04-15 12:07:34,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786343180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:34,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878204867] [2022-04-15 12:07:34,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:07:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:34,793 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-15 12:07:34,794 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-15 12:07:34,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:07:34,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:34,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:07:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:34,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:35,283 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-15 12:07:35,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {37693#true} call ULTIMATE.init(); {37693#true} is VALID [2022-04-15 12:07:35,291 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-15 12:07:35,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-15 12:07:35,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-15 12:07:35,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-15 12:07:35,292 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-15 12:07:35,293 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-15 12:07:35,293 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-15 12:07:35,293 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-15 12:07:35,293 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-15 12:07:35,294 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-15 12:07:35,294 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-15 12:07:35,294 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-15 12:07:35,294 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-15 12:07:35,295 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-15 12:07:35,295 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-15 12:07:35,295 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-15 12:07:35,296 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-15 12:07:35,296 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-15 12:07:35,296 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-15 12:07:35,297 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-15 12:07:35,297 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-15 12:07:35,297 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-15 12:07:35,298 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-15 12:07:35,298 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-15 12:07:35,299 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-15 12:07:35,299 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-15 12:07:35,299 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-15 12:07:35,300 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-15 12:07:35,300 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-15 12:07:35,301 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-15 12:07:35,301 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-15 12:07:35,301 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-15 12:07:35,302 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-15 12:07:35,302 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-15 12:07:35,302 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-15 12:07:35,303 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-15 12:07:35,303 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-15 12:07:35,304 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-15 12:07:35,304 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-15 12:07:35,304 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-15 12:07:35,305 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-15 12:07:35,305 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-15 12:07:35,306 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-15 12:07:35,306 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-15 12:07:35,306 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-15 12:07:35,307 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-15 12:07:35,307 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-15 12:07:35,308 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-15 12:07:35,308 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-15 12:07:35,308 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-15 12:07:35,309 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-15 12:07:35,309 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-15 12:07:35,310 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-15 12:07:35,310 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-15 12:07:35,311 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-15 12:07:35,312 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-15 12:07:35,312 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-15 12:07:35,312 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-15 12:07:35,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-15 12:07:35,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-15 12:07:35,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-15 12:07:35,313 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-15 12:07:35,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:35,513 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:07:35,513 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-15 12:07:35,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {37694#false} assume !false; {37694#false} is VALID [2022-04-15 12:07:35,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {37694#false} assume 0 == ~cond; {37694#false} is VALID [2022-04-15 12:07:35,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {37694#false} ~cond := #in~cond; {37694#false} is VALID [2022-04-15 12:07:35,584 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-15 12:07:35,584 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-15 12:07:35,585 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-15 12:07:35,585 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-15 12:07:35,586 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-15 12:07:35,586 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-15 12:07:35,586 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-15 12:07:35,587 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-15 12:07:35,587 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-15 12:07:35,587 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-15 12:07:35,588 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-15 12:07:35,588 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-15 12:07:35,589 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-15 12:07:35,589 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-15 12:07:35,589 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-15 12:07:35,590 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-15 12:07:35,590 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-15 12:07:35,590 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-15 12:07:35,590 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-15 12:07:35,591 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-15 12:07:35,591 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-15 12:07:35,591 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-15 12:07:35,592 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-15 12:07:35,592 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-15 12:07:35,592 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-15 12:07:35,592 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-15 12:07:35,593 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-15 12:07:35,593 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-15 12:07:35,593 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-15 12:07:35,593 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-15 12:07:35,594 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-15 12:07:35,594 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-15 12:07:35,594 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-15 12:07:35,595 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-15 12:07:35,595 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-15 12:07:35,600 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-15 12:07:35,600 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-15 12:07:35,600 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-15 12:07:35,601 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-15 12:07:35,601 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {37693#true} assume !(~i~0 % 4294967296 < 5); {37693#true} is VALID [2022-04-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,602 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-15 12:07:35,603 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-15 12:07:35,603 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-15 12:07:35,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {37693#true} call #t~ret17 := main(); {37693#true} is VALID [2022-04-15 12:07:35,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37693#true} {37693#true} #133#return; {37693#true} is VALID [2022-04-15 12:07:35,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {37693#true} assume true; {37693#true} is VALID [2022-04-15 12:07:35,603 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-15 12:07:35,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {37693#true} call ULTIMATE.init(); {37693#true} is VALID [2022-04-15 12:07:35,603 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-15 12:07:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878204867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:35,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 9] total 36 [2022-04-15 12:07:35,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:35,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734539348] [2022-04-15 12:07:35,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734539348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:35,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:07:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36191317] [2022-04-15 12:07:35,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:35,605 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-15 12:07:35,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:35,605 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-15 12:07:35,648 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-15 12:07:35,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:07:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:35,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:07:35,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:07:35,649 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-15 12:07:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:48,131 INFO L93 Difference]: Finished difference Result 1095 states and 1285 transitions. [2022-04-15 12:07:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:07:48,131 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-15 12:07:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:07:48,131 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-15 12:07:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2022-04-15 12:07:48,133 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-15 12:07:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2022-04-15 12:07:48,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 201 transitions. [2022-04-15 12:07:48,320 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-15 12:07:48,357 INFO L225 Difference]: With dead ends: 1095 [2022-04-15 12:07:48,357 INFO L226 Difference]: Without dead ends: 922 [2022-04-15 12:07:48,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=501, Invalid=2805, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:07:48,359 INFO L913 BasicCegarLoop]: 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-15 12:07:48,359 INFO L914 BasicCegarLoop]: 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-15 12:07:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-04-15 12:07:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 375. [2022-04-15 12:07:51,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:07:51,925 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-15 12:07:51,925 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-15 12:07:51,925 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-15 12:07:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:51,958 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2022-04-15 12:07:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1072 transitions. [2022-04-15 12:07:51,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:51,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:51,959 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-15 12:07:51,959 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-15 12:07:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:07:51,991 INFO L93 Difference]: Finished difference Result 922 states and 1072 transitions. [2022-04-15 12:07:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1072 transitions. [2022-04-15 12:07:51,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:07:51,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:07:51,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:07:51,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:07:51,992 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-15 12:07:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2022-04-15 12:07:52,002 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 62 [2022-04-15 12:07:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:07:52,002 INFO L478 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2022-04-15 12:07:52,003 INFO L479 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-15 12:07:52,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 375 states and 435 transitions. [2022-04-15 12:07:53,966 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-15 12:07:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2022-04-15 12:07:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:07:53,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:07:53,967 INFO L499 BasicCegarLoop]: 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-15 12:07:53,984 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-15 12:07:54,167 WARN L460 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-15 12:07:54,168 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:07:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:07:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -970116796, now seen corresponding path program 9 times [2022-04-15 12:07:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:54,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704874277] [2022-04-15 12:07:54,172 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:07:54,172 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:07:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -970116796, now seen corresponding path program 10 times [2022-04-15 12:07:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:07:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429227530] [2022-04-15 12:07:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:07:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:07:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:07:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:54,453 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-15 12:07:54,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-15 12:07:54,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-15 12:07:54,454 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-15 12:07:54,454 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-15 12:07:54,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-15 12:07:54,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-15 12:07:54,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-15 12:07:54,454 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-15 12:07:54,455 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-15 12:07:54,455 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-15 12:07:54,456 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-15 12:07:54,456 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-15 12:07:54,457 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-15 12:07:54,457 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-15 12:07:54,457 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-15 12:07:54,458 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-15 12:07:54,458 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-15 12:07:54,459 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-15 12:07:54,459 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-15 12:07:54,459 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-15 12:07:54,460 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-15 12:07:54,460 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-15 12:07:54,461 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-15 12:07:54,462 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-15 12:07:54,463 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-15 12:07:54,463 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-15 12:07:54,464 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-15 12:07:54,464 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-15 12:07:54,465 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-15 12:07:54,466 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-15 12:07:54,466 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-15 12:07:54,467 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-15 12:07:54,467 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-15 12:07:54,468 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-15 12:07:54,468 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-15 12:07:54,469 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-15 12:07:54,469 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-15 12:07:54,470 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-15 12:07:54,470 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-15 12:07:54,471 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-15 12:07:54,471 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-15 12:07:54,472 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-15 12:07:54,472 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-15 12:07:54,473 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-15 12:07:54,473 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-15 12:07:54,474 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-15 12:07:54,474 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-15 12:07:54,475 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-15 12:07:54,475 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-15 12:07:54,476 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-15 12:07:54,476 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-15 12:07:54,477 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-15 12:07:54,477 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-15 12:07:54,478 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-15 12:07:54,478 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-15 12:07:54,479 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-15 12:07:54,479 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-15 12:07:54,480 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-15 12:07:54,481 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-15 12:07:54,481 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-15 12:07:54,481 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-15 12:07:54,481 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-15 12:07:54,481 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-15 12:07:54,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-15 12:07:54,482 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-15 12:07:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:07:54,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429227530] [2022-04-15 12:07:54,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429227530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:07:54,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075988352] [2022-04-15 12:07:54,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:07:54,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:07:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:07:54,488 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-15 12:07:54,489 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-15 12:07:54,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:07:54,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:07:54,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:07:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:07:54,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:07:54,926 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-15 12:07:54,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {42931#true} call ULTIMATE.init(); {42931#true} is VALID [2022-04-15 12:07:54,934 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-15 12:07:54,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-15 12:07:54,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-15 12:07:54,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-15 12:07:54,935 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-15 12:07:54,936 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-15 12:07:54,936 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-15 12:07:54,936 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-15 12:07:54,936 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-15 12:07:54,937 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-15 12:07:54,937 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-15 12:07:54,937 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-15 12:07:54,938 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-15 12:07:54,938 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-15 12:07:54,938 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-15 12:07:54,938 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-15 12:07:54,939 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-15 12:07:54,939 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-15 12:07:54,939 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-15 12:07:54,940 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-15 12:07:54,940 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-15 12:07:54,941 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-15 12:07:54,941 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-15 12:07:54,941 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-15 12:07:54,942 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-15 12:07:54,942 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-15 12:07:54,942 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-15 12:07:54,943 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-15 12:07:54,943 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-15 12:07:54,944 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-15 12:07:54,944 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-15 12:07:54,944 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-15 12:07:54,945 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-15 12:07:54,945 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-15 12:07:54,945 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-15 12:07:54,946 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-15 12:07:54,946 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-15 12:07:54,947 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-15 12:07:54,947 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-15 12:07:54,947 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-15 12:07:54,948 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-15 12:07:54,948 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-15 12:07:54,949 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-15 12:07:54,949 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-15 12:07:54,949 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-15 12:07:54,950 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-15 12:07:54,950 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-15 12:07:54,950 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-15 12:07:54,951 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-15 12:07:54,951 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-15 12:07:54,952 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-15 12:07:54,952 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-15 12:07:54,952 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-15 12:07:54,953 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-15 12:07:54,953 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-15 12:07:54,954 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-15 12:07:54,954 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-15 12:07:54,954 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-15 12:07:54,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-15 12:07:54,954 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-15 12:07:54,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-15 12:07:54,954 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-15 12:07:54,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:07:55,127 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:07:55,127 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-15 12:07:55,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {42932#false} assume !false; {42932#false} is VALID [2022-04-15 12:07:55,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#false} assume 0 == ~cond; {42932#false} is VALID [2022-04-15 12:07:55,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {42932#false} ~cond := #in~cond; {42932#false} is VALID [2022-04-15 12:07:55,188 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-15 12:07:55,188 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-15 12:07:55,188 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-15 12:07:55,189 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-15 12:07:55,190 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-15 12:07:55,190 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-15 12:07:55,190 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-15 12:07:55,191 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-15 12:07:55,191 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-15 12:07:55,192 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-15 12:07:55,192 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-15 12:07:55,192 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-15 12:07:55,193 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-15 12:07:55,193 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-15 12:07:55,194 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-15 12:07:55,194 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-15 12:07:55,194 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-15 12:07:55,194 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-15 12:07:55,195 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-15 12:07:55,195 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-15 12:07:55,195 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-15 12:07:55,196 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-15 12:07:55,196 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-15 12:07:55,196 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-15 12:07:55,196 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-15 12:07:55,197 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-15 12:07:55,197 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-15 12:07:55,197 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-15 12:07:55,198 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-15 12:07:55,198 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-15 12:07:55,198 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-15 12:07:55,199 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-15 12:07:55,199 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-15 12:07:55,199 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-15 12:07:55,200 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-15 12:07:55,200 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-15 12:07:55,200 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-15 12:07:55,201 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-15 12:07:55,201 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {42931#true} assume !(~i~0 % 4294967296 < 5); {42931#true} is VALID [2022-04-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,202 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-15 12:07:55,203 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-15 12:07:55,203 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-15 12:07:55,203 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-15 12:07:55,203 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-15 12:07:55,203 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-15 12:07:55,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {42931#true} call #t~ret17 := main(); {42931#true} is VALID [2022-04-15 12:07:55,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42931#true} {42931#true} #133#return; {42931#true} is VALID [2022-04-15 12:07:55,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {42931#true} assume true; {42931#true} is VALID [2022-04-15 12:07:55,203 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-15 12:07:55,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {42931#true} call ULTIMATE.init(); {42931#true} is VALID [2022-04-15 12:07:55,203 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-15 12:07:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075988352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:07:55,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:07:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2022-04-15 12:07:55,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:07:55,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704874277] [2022-04-15 12:07:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704874277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:07:55,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:07:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:07:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76797537] [2022-04-15 12:07:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:07:55,205 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-15 12:07:55,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:07:55,205 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-15 12:07:55,236 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-15 12:07:55,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:07:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:07:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:07:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:07:55,237 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-15 12:08:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:00,881 INFO L93 Difference]: Finished difference Result 507 states and 586 transitions. [2022-04-15 12:08:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:08:00,881 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-15 12:08:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:08:00,882 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-15 12:08:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-15 12:08:00,882 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-15 12:08:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-15 12:08:00,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-15 12:08:00,953 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-15 12:08:00,963 INFO L225 Difference]: With dead ends: 507 [2022-04-15 12:08:00,964 INFO L226 Difference]: Without dead ends: 502 [2022-04-15 12:08:00,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:08:00,964 INFO L913 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:08:00,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 51 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:08:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-15 12:08:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 370. [2022-04-15 12:08:04,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:08:04,380 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-15 12:08:04,380 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-15 12:08:04,381 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-15 12:08:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:04,389 INFO L93 Difference]: Finished difference Result 502 states and 579 transitions. [2022-04-15 12:08:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 579 transitions. [2022-04-15 12:08:04,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:04,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:04,390 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-15 12:08:04,390 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-15 12:08:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:04,399 INFO L93 Difference]: Finished difference Result 502 states and 579 transitions. [2022-04-15 12:08:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 579 transitions. [2022-04-15 12:08:04,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:04,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:04,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:08:04,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:08:04,400 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-15 12:08:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 430 transitions. [2022-04-15 12:08:04,407 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 430 transitions. Word has length 62 [2022-04-15 12:08:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:08:04,408 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 430 transitions. [2022-04-15 12:08:04,408 INFO L479 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-15 12:08:04,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 430 transitions. [2022-04-15 12:08:06,123 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-15 12:08:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 430 transitions. [2022-04-15 12:08:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:08:06,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:08:06,124 INFO L499 BasicCegarLoop]: 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-15 12:08:06,147 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-15 12:08:06,347 WARN L460 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-15 12:08:06,348 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:08:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:08:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash 475673560, now seen corresponding path program 11 times [2022-04-15 12:08:06,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:06,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751613823] [2022-04-15 12:08:06,352 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:06,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:08:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 475673560, now seen corresponding path program 12 times [2022-04-15 12:08:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:08:06,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796656981] [2022-04-15 12:08:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:08:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:08:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:08:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:06,474 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-15 12:08:06,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-15 12:08:06,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-15 12:08:06,475 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-15 12:08:06,475 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-15 12:08:06,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-15 12:08:06,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-15 12:08:06,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-15 12:08:06,475 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-15 12:08:06,487 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-15 12:08:06,487 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-15 12:08:06,487 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-15 12:08:06,487 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-15 12:08:06,488 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-15 12:08:06,488 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-15 12:08:06,488 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-15 12:08:06,488 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-15 12:08:06,488 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-15 12:08:06,488 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-15 12:08:06,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {46100#true} assume !(~i~0 % 4294967296 < 5); {46100#true} is VALID [2022-04-15 12:08:06,488 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-15 12:08:06,489 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-15 12:08:06,489 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-15 12:08:06,489 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-15 12:08:06,490 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-15 12:08:06,490 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-15 12:08:06,491 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-15 12:08:06,491 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-15 12:08:06,492 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-15 12:08:06,492 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-15 12:08:06,493 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-15 12:08:06,493 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-15 12:08:06,494 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-15 12:08:06,494 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-15 12:08:06,494 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-15 12:08:06,495 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-15 12:08:06,495 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-15 12:08:06,496 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-15 12:08:06,496 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-15 12:08:06,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,497 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-15 12:08:06,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,497 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-15 12:08:06,497 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-15 12:08:06,497 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-15 12:08:06,497 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-15 12:08:06,497 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-15 12:08:06,497 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-15 12:08:06,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-15 12:08:06,497 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-15 12:08:06,498 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-15 12:08:06,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,498 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-15 12:08:06,498 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-15 12:08:06,498 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-15 12:08:06,498 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-15 12:08:06,498 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-15 12:08:06,498 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-15 12:08:06,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-15 12:08:06,498 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-15 12:08:06,499 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-15 12:08:06,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {46101#false} assume !(0 != #t~mem11);havoc #t~mem11; {46101#false} is VALID [2022-04-15 12:08:06,499 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-15 12:08:06,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-15 12:08:06,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-15 12:08:06,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-15 12:08:06,499 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-15 12:08:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:08:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796656981] [2022-04-15 12:08:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796656981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:08:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363929271] [2022-04-15 12:08:06,500 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:08:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:08:06,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:08:06,501 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-15 12:08:06,530 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-15 12:08:06,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:08:06,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:08:06,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:08:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:06,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:08:06,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {46100#true} call ULTIMATE.init(); {46100#true} is VALID [2022-04-15 12:08:06,967 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-15 12:08:06,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-15 12:08:06,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-15 12:08:06,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-15 12:08:06,968 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-15 12:08:06,969 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-15 12:08:06,969 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-15 12:08:06,969 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-15 12:08:06,970 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-15 12:08:06,970 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-15 12:08:06,970 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-15 12:08:06,971 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-15 12:08:06,971 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-15 12:08:06,971 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-15 12:08:06,971 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-15 12:08:06,972 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-15 12:08:06,972 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-15 12:08:06,972 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-15 12:08:06,973 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-15 12:08:06,973 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-15 12:08:06,973 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-15 12:08:06,974 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-15 12:08:06,974 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-15 12:08:06,975 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-15 12:08:06,975 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-15 12:08:06,975 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-15 12:08:06,976 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-15 12:08:06,976 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-15 12:08:06,976 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-15 12:08:06,977 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-15 12:08:06,977 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-15 12:08:06,978 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-15 12:08:06,978 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-15 12:08:06,978 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-15 12:08:06,979 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-15 12:08:06,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,979 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-15 12:08:06,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,979 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-15 12:08:06,979 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-15 12:08:06,979 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-15 12:08:06,979 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-15 12:08:06,979 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-15 12:08:06,979 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-15 12:08:06,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-15 12:08:06,979 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-15 12:08:06,980 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-15 12:08:06,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {46101#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {46101#false} is VALID [2022-04-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-15 12:08:06,980 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-15 12:08:06,980 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-15 12:08:06,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {46101#false} assume !(0 != #t~mem11);havoc #t~mem11; {46101#false} is VALID [2022-04-15 12:08:06,980 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-15 12:08:06,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-15 12:08:06,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-15 12:08:06,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-15 12:08:06,981 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-15 12:08:06,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:08:07,099 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-04-15 12:08:07,099 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-15 12:08:07,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {46101#false} assume !false; {46101#false} is VALID [2022-04-15 12:08:07,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {46101#false} assume 0 == ~cond; {46101#false} is VALID [2022-04-15 12:08:07,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {46101#false} ~cond := #in~cond; {46101#false} is VALID [2022-04-15 12:08:07,449 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-15 12:08:07,449 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-15 12:08:07,449 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-15 12:08:07,451 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-15 12:08:07,451 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-15 12:08:07,452 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-15 12:08:07,452 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-15 12:08:07,453 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-15 12:08:07,453 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-15 12:08:07,454 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-15 12:08:07,454 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-15 12:08:07,455 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-15 12:08:07,455 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-15 12:08:07,455 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-15 12:08:07,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {46101#false} assume !(~j~0 % 4294967296 < 2); {46101#false} is VALID [2022-04-15 12:08:07,455 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-15 12:08:07,455 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-15 12:08:07,455 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-15 12:08:07,456 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-15 12:08:07,456 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-15 12:08:07,457 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-15 12:08:07,457 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-15 12:08:07,457 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-15 12:08:07,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {46101#false} ~i~0 := 0;~cont_aux~0 := 0; {46101#false} is VALID [2022-04-15 12:08:07,458 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-15 12:08:07,458 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-15 12:08:07,459 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-15 12:08:07,459 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-15 12:08:07,459 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-15 12:08:07,460 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-15 12:08:07,460 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-15 12:08:07,460 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-15 12:08:07,461 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-15 12:08:07,461 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-15 12:08:07,462 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-15 12:08:07,462 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-15 12:08:07,463 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-15 12:08:07,464 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-15 12:08:07,464 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-15 12:08:07,465 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-15 12:08:07,465 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-15 12:08:07,466 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-15 12:08:07,466 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-15 12:08:07,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {46100#true} assume !(~i~0 % 4294967296 < 5); {46100#true} is VALID [2022-04-15 12:08:07,466 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-15 12:08:07,466 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-15 12:08:07,466 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-15 12:08:07,466 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 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-15 12:08:07,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {46100#true} call #t~ret17 := main(); {46100#true} is VALID [2022-04-15 12:08:07,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46100#true} {46100#true} #133#return; {46100#true} is VALID [2022-04-15 12:08:07,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {46100#true} assume true; {46100#true} is VALID [2022-04-15 12:08:07,468 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-15 12:08:07,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {46100#true} call ULTIMATE.init(); {46100#true} is VALID [2022-04-15 12:08:07,468 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-15 12:08:07,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363929271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:08:07,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:08:07,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 29 [2022-04-15 12:08:07,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:08:07,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751613823] [2022-04-15 12:08:07,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751613823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:08:07,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:08:07,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:08:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170460870] [2022-04-15 12:08:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:08:07,469 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-15 12:08:07,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:08:07,470 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-15 12:08:07,502 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-15 12:08:07,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:08:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:07,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:08:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:08:07,503 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-15 12:08:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:14,920 INFO L93 Difference]: Finished difference Result 739 states and 855 transitions. [2022-04-15 12:08:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:08:14,920 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-15 12:08:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:08:14,920 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-15 12:08:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-15 12:08:14,921 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-15 12:08:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-15 12:08:14,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-15 12:08:15,002 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-15 12:08:15,019 INFO L225 Difference]: With dead ends: 739 [2022-04-15 12:08:15,019 INFO L226 Difference]: Without dead ends: 690 [2022-04-15 12:08:15,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:08:15,020 INFO L913 BasicCegarLoop]: 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-15 12:08:15,020 INFO L914 BasicCegarLoop]: 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-15 12:08:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-04-15 12:08:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 370. [2022-04-15 12:08:18,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:08:18,584 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-15 12:08:18,584 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-15 12:08:18,584 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-15 12:08:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:18,604 INFO L93 Difference]: Finished difference Result 690 states and 799 transitions. [2022-04-15 12:08:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 799 transitions. [2022-04-15 12:08:18,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:18,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:18,606 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-15 12:08:18,606 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-15 12:08:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:18,629 INFO L93 Difference]: Finished difference Result 690 states and 799 transitions. [2022-04-15 12:08:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 799 transitions. [2022-04-15 12:08:18,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:18,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:18,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:08:18,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:08:18,631 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-15 12:08:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 427 transitions. [2022-04-15 12:08:18,640 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 427 transitions. Word has length 63 [2022-04-15 12:08:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:08:18,640 INFO L478 AbstractCegarLoop]: Abstraction has 370 states and 427 transitions. [2022-04-15 12:08:18,640 INFO L479 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-15 12:08:18,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 370 states and 427 transitions. [2022-04-15 12:08:20,604 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-15 12:08:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 427 transitions. [2022-04-15 12:08:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:08:20,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:08:20,605 INFO L499 BasicCegarLoop]: 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-15 12:08:20,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 12:08:20,805 WARN L460 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-15 12:08:20,805 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:08:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:08:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2031628323, now seen corresponding path program 13 times [2022-04-15 12:08:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:20,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787637795] [2022-04-15 12:08:20,810 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:20,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:08:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2031628323, now seen corresponding path program 14 times [2022-04-15 12:08:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:08:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970607817] [2022-04-15 12:08:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:08:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:08:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:08:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:20,952 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-15 12:08:20,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-15 12:08:20,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-15 12:08:20,953 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-15 12:08:20,953 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-15 12:08:20,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-15 12:08:20,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-15 12:08:20,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-15 12:08:20,953 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-15 12:08:20,953 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-15 12:08:20,953 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-15 12:08:20,953 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 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-15 12:08:20,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {50117#true} assume !(~i~0 % 4294967296 < 5); {50117#true} is VALID [2022-04-15 12:08:20,954 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-15 12:08:20,955 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-15 12:08:20,955 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-15 12:08:20,956 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-15 12:08:20,956 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-15 12:08:20,957 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-15 12:08:20,957 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-15 12:08:20,958 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-15 12:08:20,958 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-15 12:08:20,959 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-15 12:08:20,959 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-15 12:08:20,960 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-15 12:08:20,960 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-15 12:08:20,961 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-15 12:08:20,961 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-15 12:08:20,962 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-15 12:08:20,962 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-15 12:08:20,963 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-15 12:08:20,963 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-15 12:08:20,964 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-15 12:08:20,964 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-15 12:08:20,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {50118#false} ~i~0 := 0;~cont_aux~0 := 0; {50118#false} is VALID [2022-04-15 12:08:20,965 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-15 12:08:20,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {50118#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50118#false} is VALID [2022-04-15 12:08:20,965 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-15 12:08:20,965 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-15 12:08:20,965 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-15 12:08:20,965 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-15 12:08:20,965 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-15 12:08:20,965 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-15 12:08:20,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {50118#false} assume !(~j~0 % 4294967296 < 2); {50118#false} is VALID [2022-04-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {50118#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {50118#false} is VALID [2022-04-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 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-15 12:08:20,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {50118#false} assume !(~j~0 % 4294967296 < 2); {50118#false} is VALID [2022-04-15 12:08:20,966 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-15 12:08:20,967 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-15 12:08:20,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {50118#false} assume !(0 != #t~mem11);havoc #t~mem11; {50118#false} is VALID [2022-04-15 12:08:20,967 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-15 12:08:20,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-15 12:08:20,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-15 12:08:20,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-15 12:08:20,967 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-15 12:08:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:08:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970607817] [2022-04-15 12:08:20,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970607817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:08:20,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605766371] [2022-04-15 12:08:20,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:08:20,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:08:20,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:08:20,969 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-15 12:08:20,970 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-15 12:08:21,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:08:21,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:08:21,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:08:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:21,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:08:21,584 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-15 12:08:21,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {50117#true} call ULTIMATE.init(); {50117#true} is VALID [2022-04-15 12:08:21,602 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-15 12:08:21,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-15 12:08:21,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-15 12:08:21,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-15 12:08:21,603 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-15 12:08:21,603 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-15 12:08:21,603 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-15 12:08:21,604 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-15 12:08:21,604 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-15 12:08:21,604 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-15 12:08:21,605 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-15 12:08:21,605 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-15 12:08:21,605 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-15 12:08:21,605 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-15 12:08:21,606 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-15 12:08:21,606 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-15 12:08:21,606 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-15 12:08:21,607 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-15 12:08:21,607 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-15 12:08:21,607 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-15 12:08:21,608 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-15 12:08:21,608 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-15 12:08:21,608 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-15 12:08:21,609 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-15 12:08:21,609 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-15 12:08:21,610 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-15 12:08:21,610 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-15 12:08:21,610 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-15 12:08:21,611 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-15 12:08:21,611 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-15 12:08:21,612 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-15 12:08:21,612 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-15 12:08:21,612 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-15 12:08:21,613 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-15 12:08:21,613 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-15 12:08:21,613 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-15 12:08:21,614 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-15 12:08:21,614 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-15 12:08:21,615 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-15 12:08:21,615 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-15 12:08:21,615 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-15 12:08:21,616 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-15 12:08:21,616 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-15 12:08:21,617 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-15 12:08:21,617 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-15 12:08:21,617 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-15 12:08:21,618 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-15 12:08:21,618 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-15 12:08:21,619 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-15 12:08:21,619 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-15 12:08:21,619 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-15 12:08:21,620 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-15 12:08:21,620 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-15 12:08:21,621 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-15 12:08:21,621 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-15 12:08:21,621 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-15 12:08:21,622 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-15 12:08:21,622 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-15 12:08:21,623 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-15 12:08:21,623 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-15 12:08:21,623 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-15 12:08:21,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-15 12:08:21,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-15 12:08:21,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-15 12:08:21,623 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-15 12:08:21,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:08:21,830 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:08:21,831 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-15 12:08:21,921 INFO L290 TraceCheckUtils]: 64: Hoare triple {50118#false} assume !false; {50118#false} is VALID [2022-04-15 12:08:21,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {50118#false} assume 0 == ~cond; {50118#false} is VALID [2022-04-15 12:08:21,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {50118#false} ~cond := #in~cond; {50118#false} is VALID [2022-04-15 12:08:21,921 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-15 12:08:21,922 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-15 12:08:21,922 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-15 12:08:21,923 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-15 12:08:21,923 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-15 12:08:21,923 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-15 12:08:21,924 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-15 12:08:21,924 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-15 12:08:21,925 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-15 12:08:21,925 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-15 12:08:21,925 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-15 12:08:21,926 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-15 12:08:21,926 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-15 12:08:21,927 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-15 12:08:21,927 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-15 12:08:21,927 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-15 12:08:21,928 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-15 12:08:21,928 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-15 12:08:21,928 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-15 12:08:21,928 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-15 12:08:21,929 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-15 12:08:21,929 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-15 12:08:21,929 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-15 12:08:21,930 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-15 12:08:21,930 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-15 12:08:21,930 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-15 12:08:21,930 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-15 12:08:21,931 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-15 12:08:21,931 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-15 12:08:21,931 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-15 12:08:21,932 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-15 12:08:21,932 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-15 12:08:21,932 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-15 12:08:21,932 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-15 12:08:21,933 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-15 12:08:21,933 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-15 12:08:21,933 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-15 12:08:21,934 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-15 12:08:21,934 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-15 12:08:21,935 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-15 12:08:21,935 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-15 12:08:21,935 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-15 12:08:21,936 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-15 12:08:21,936 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-15 12:08:21,936 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-15 12:08:21,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {50117#true} assume !(~i~0 % 4294967296 < 5); {50117#true} is VALID [2022-04-15 12:08:21,936 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-15 12:08:21,936 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,937 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-15 12:08:21,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {50117#true} call #t~ret17 := main(); {50117#true} is VALID [2022-04-15 12:08:21,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50117#true} {50117#true} #133#return; {50117#true} is VALID [2022-04-15 12:08:21,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {50117#true} assume true; {50117#true} is VALID [2022-04-15 12:08:21,938 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-15 12:08:21,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {50117#true} call ULTIMATE.init(); {50117#true} is VALID [2022-04-15 12:08:21,938 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-15 12:08:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605766371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:08:21,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:08:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 30 [2022-04-15 12:08:21,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:08:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787637795] [2022-04-15 12:08:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787637795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:08:21,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:08:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:08:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106058237] [2022-04-15 12:08:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:08:21,940 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-15 12:08:21,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:08:21,941 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-15 12:08:21,974 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-15 12:08:21,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:08:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:08:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:08:21,975 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-15 12:08:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:34,892 INFO L93 Difference]: Finished difference Result 1028 states and 1191 transitions. [2022-04-15 12:08:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:08:34,892 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-15 12:08:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:08:34,892 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-15 12:08:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2022-04-15 12:08:34,895 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-15 12:08:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2022-04-15 12:08:34,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 147 transitions. [2022-04-15 12:08:35,034 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-15 12:08:35,087 INFO L225 Difference]: With dead ends: 1028 [2022-04-15 12:08:35,087 INFO L226 Difference]: Without dead ends: 979 [2022-04-15 12:08:35,089 INFO L912 BasicCegarLoop]: 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-15 12:08:35,093 INFO L913 BasicCegarLoop]: 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-15 12:08:35,093 INFO L914 BasicCegarLoop]: 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-15 12:08:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-04-15 12:08:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 394. [2022-04-15 12:08:40,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:08:40,392 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-15 12:08:40,393 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-15 12:08:40,393 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-15 12:08:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:40,433 INFO L93 Difference]: Finished difference Result 979 states and 1135 transitions. [2022-04-15 12:08:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1135 transitions. [2022-04-15 12:08:40,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:40,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:40,436 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-15 12:08:40,436 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-15 12:08:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:08:40,497 INFO L93 Difference]: Finished difference Result 979 states and 1135 transitions. [2022-04-15 12:08:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1135 transitions. [2022-04-15 12:08:40,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:08:40,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:08:40,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:08:40,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:08:40,499 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-15 12:08:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 454 transitions. [2022-04-15 12:08:40,529 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 454 transitions. Word has length 65 [2022-04-15 12:08:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:08:40,529 INFO L478 AbstractCegarLoop]: Abstraction has 394 states and 454 transitions. [2022-04-15 12:08:40,529 INFO L479 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-15 12:08:40,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 394 states and 454 transitions. [2022-04-15 12:08:43,083 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-15 12:08:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 454 transitions. [2022-04-15 12:08:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:08:43,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:08:43,084 INFO L499 BasicCegarLoop]: 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-15 12:08:43,111 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-15 12:08:43,285 WARN L460 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-15 12:08:43,285 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:08:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:08:43,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2072084830, now seen corresponding path program 15 times [2022-04-15 12:08:43,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:43,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147053678] [2022-04-15 12:08:43,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:08:43,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:08:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2072084830, now seen corresponding path program 16 times [2022-04-15 12:08:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:08:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280604932] [2022-04-15 12:08:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:08:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:08:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:43,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:08:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:43,849 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-15 12:08:43,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-15 12:08:43,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-15 12:08:43,850 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-15 12:08:43,850 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-15 12:08:43,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-15 12:08:43,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-15 12:08:43,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,851 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-15 12:08:43,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {55355#true} assume !(~i~0 % 4294967296 < 5); {55355#true} is VALID [2022-04-15 12:08:43,852 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-15 12:08:43,852 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-15 12:08:43,853 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-15 12:08:43,853 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-15 12:08:43,854 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-15 12:08:43,855 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-15 12:08:43,855 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-15 12:08:43,856 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-15 12:08:43,856 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-15 12:08:43,857 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-15 12:08:43,857 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-15 12:08:43,857 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-15 12:08:43,858 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-15 12:08:43,859 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-15 12:08:43,859 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-15 12:08:43,860 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-15 12:08:43,860 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-15 12:08:43,861 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-15 12:08:43,861 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-15 12:08:43,862 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-15 12:08:43,862 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-15 12:08:43,863 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-15 12:08:43,863 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-15 12:08:43,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {55356#false} ~i~0 := 0;~cont_aux~0 := 0; {55356#false} is VALID [2022-04-15 12:08:43,864 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-15 12:08:43,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {55356#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55356#false} is VALID [2022-04-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {55356#false} assume !(~j~0 % 4294967296 < 2); {55356#false} is VALID [2022-04-15 12:08:43,864 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-15 12:08:43,864 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-15 12:08:43,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {55356#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {55356#false} is VALID [2022-04-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {55356#false} assume !(~j~0 % 4294967296 < 2); {55356#false} is VALID [2022-04-15 12:08:43,865 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-15 12:08:43,865 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-15 12:08:43,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {55356#false} assume !(0 != #t~mem11);havoc #t~mem11; {55356#false} is VALID [2022-04-15 12:08:43,866 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-15 12:08:43,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-15 12:08:43,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-15 12:08:43,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-15 12:08:43,866 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-15 12:08:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:08:43,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280604932] [2022-04-15 12:08:43,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280604932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:08:43,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004816800] [2022-04-15 12:08:43,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:08:43,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:08:43,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:08:43,868 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-15 12:08:43,870 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-15 12:08:43,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:08:43,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:08:43,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:08:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:08:44,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:08:44,602 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-15 12:08:44,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {55355#true} call ULTIMATE.init(); {55355#true} is VALID [2022-04-15 12:08:44,625 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-15 12:08:44,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-15 12:08:44,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-15 12:08:44,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-15 12:08:44,626 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-15 12:08:44,627 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-15 12:08:44,627 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-15 12:08:44,628 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-15 12:08:44,628 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-15 12:08:44,628 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-15 12:08:44,629 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-15 12:08:44,629 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-15 12:08:44,629 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-15 12:08:44,630 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-15 12:08:44,630 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-15 12:08:44,630 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-15 12:08:44,631 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-15 12:08:44,631 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-15 12:08:44,631 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-15 12:08:44,632 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-15 12:08:44,632 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-15 12:08:44,633 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-15 12:08:44,633 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-15 12:08:44,634 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-15 12:08:44,634 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-15 12:08:44,635 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-15 12:08:44,635 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-15 12:08:44,635 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-15 12:08:44,636 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-15 12:08:44,636 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-15 12:08:44,637 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-15 12:08:44,637 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-15 12:08:44,638 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-15 12:08:44,638 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-15 12:08:44,639 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-15 12:08:44,639 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-15 12:08:44,640 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-15 12:08:44,640 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-15 12:08:44,641 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-15 12:08:44,641 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-15 12:08:44,642 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-15 12:08:44,642 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-15 12:08:44,643 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-15 12:08:44,643 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-15 12:08:44,644 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-15 12:08:44,644 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-15 12:08:44,645 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-15 12:08:44,645 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-15 12:08:44,646 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-15 12:08:44,646 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-15 12:08:44,647 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-15 12:08:44,647 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-15 12:08:44,648 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-15 12:08:44,648 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-15 12:08:44,649 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-15 12:08:44,649 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-15 12:08:44,650 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-15 12:08:44,650 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-15 12:08:44,651 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-15 12:08:44,651 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-15 12:08:44,651 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-15 12:08:44,652 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-15 12:08:44,652 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-15 12:08:44,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-15 12:08:44,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-15 12:08:44,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-15 12:08:44,653 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-15 12:08:44,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:08:44,938 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:08:44,939 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-15 12:08:45,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {55356#false} assume !false; {55356#false} is VALID [2022-04-15 12:08:45,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {55356#false} assume 0 == ~cond; {55356#false} is VALID [2022-04-15 12:08:45,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {55356#false} ~cond := #in~cond; {55356#false} is VALID [2022-04-15 12:08:45,055 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-15 12:08:45,055 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-15 12:08:45,056 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-15 12:08:45,057 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-15 12:08:45,057 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-15 12:08:45,058 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-15 12:08:45,058 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-15 12:08:45,059 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-15 12:08:45,059 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-15 12:08:45,060 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-15 12:08:45,060 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-15 12:08:45,061 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-15 12:08:45,061 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-15 12:08:45,062 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-15 12:08:45,063 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-15 12:08:45,063 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-15 12:08:45,063 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-15 12:08:45,064 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-15 12:08:45,064 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-15 12:08:45,064 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-15 12:08:45,065 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-15 12:08:45,065 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-15 12:08:45,065 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-15 12:08:45,066 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-15 12:08:45,066 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-15 12:08:45,066 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-15 12:08:45,067 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-15 12:08:45,067 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-15 12:08:45,067 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-15 12:08:45,068 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-15 12:08:45,068 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-15 12:08:45,068 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-15 12:08:45,069 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-15 12:08:45,069 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-15 12:08:45,069 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-15 12:08:45,070 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-15 12:08:45,070 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-15 12:08:45,070 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-15 12:08:45,071 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-15 12:08:45,071 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-15 12:08:45,072 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-15 12:08:45,073 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-15 12:08:45,073 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-15 12:08:45,074 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-15 12:08:45,074 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-15 12:08:45,074 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-15 12:08:45,075 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-15 12:08:45,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {55355#true} assume !(~i~0 % 4294967296 < 5); {55355#true} is VALID [2022-04-15 12:08:45,079 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-15 12:08:45,079 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-15 12:08:45,079 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-15 12:08:45,079 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 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-15 12:08:45,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {55355#true} call #t~ret17 := main(); {55355#true} is VALID [2022-04-15 12:08:45,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55355#true} {55355#true} #133#return; {55355#true} is VALID [2022-04-15 12:08:45,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {55355#true} assume true; {55355#true} is VALID [2022-04-15 12:08:45,081 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-15 12:08:45,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {55355#true} call ULTIMATE.init(); {55355#true} is VALID [2022-04-15 12:08:45,081 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-15 12:08:45,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004816800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:08:45,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:08:45,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 11] total 30 [2022-04-15 12:08:45,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:08:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147053678] [2022-04-15 12:08:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147053678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:08:45,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:08:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:08:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335985096] [2022-04-15 12:08:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:08:45,096 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-15 12:08:45,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:08:45,096 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-15 12:08:45,132 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-15 12:08:45,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:08:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:08:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:08:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:08:45,133 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-15 12:09:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:04,894 INFO L93 Difference]: Finished difference Result 1296 states and 1503 transitions. [2022-04-15 12:09:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:09:04,894 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-15 12:09:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:09:04,899 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-15 12:09:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-04-15 12:09:04,900 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-15 12:09:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-04-15 12:09:04,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 170 transitions. [2022-04-15 12:09:05,060 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-15 12:09:05,121 INFO L225 Difference]: With dead ends: 1296 [2022-04-15 12:09:05,121 INFO L226 Difference]: Without dead ends: 1247 [2022-04-15 12:09:05,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:09:05,122 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 198 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:09:05,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 110 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:09:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-04-15 12:09:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 396. [2022-04-15 12:09:09,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:09:09,235 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-15 12:09:09,235 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-15 12:09:09,235 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-15 12:09:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:09,278 INFO L93 Difference]: Finished difference Result 1247 states and 1447 transitions. [2022-04-15 12:09:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1447 transitions. [2022-04-15 12:09:09,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:09,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:09,279 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-15 12:09:09,280 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-15 12:09:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:09,328 INFO L93 Difference]: Finished difference Result 1247 states and 1447 transitions. [2022-04-15 12:09:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1447 transitions. [2022-04-15 12:09:09,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:09,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:09,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:09:09,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:09:09,330 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-15 12:09:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 457 transitions. [2022-04-15 12:09:09,341 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 457 transitions. Word has length 67 [2022-04-15 12:09:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:09:09,341 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 457 transitions. [2022-04-15 12:09:09,341 INFO L479 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-15 12:09:09,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 457 transitions. [2022-04-15 12:09:11,460 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-15 12:09:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 457 transitions. [2022-04-15 12:09:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:09:11,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:09:11,461 INFO L499 BasicCegarLoop]: 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-15 12:09:11,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:09:11,662 WARN L460 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-15 12:09:11,662 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:09:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:09:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1998884903, now seen corresponding path program 17 times [2022-04-15 12:09:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087364498] [2022-04-15 12:09:11,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:09:11,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:09:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1998884903, now seen corresponding path program 18 times [2022-04-15 12:09:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:09:11,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961700492] [2022-04-15 12:09:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:09:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:09:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:09:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:11,854 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-15 12:09:11,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-15 12:09:11,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-15 12:09:11,854 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-15 12:09:11,855 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-15 12:09:11,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-15 12:09:11,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-15 12:09:11,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,855 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-15 12:09:11,856 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-15 12:09:11,856 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-15 12:09:11,856 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-15 12:09:11,856 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-15 12:09:11,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {61683#true} assume !(~i~0 % 4294967296 < 5); {61683#true} is VALID [2022-04-15 12:09:11,856 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-15 12:09:11,856 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-15 12:09:11,857 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-15 12:09:11,857 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-15 12:09:11,858 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-15 12:09:11,858 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-15 12:09:11,859 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-15 12:09:11,859 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-15 12:09:11,860 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-15 12:09:11,861 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-15 12:09:11,861 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-15 12:09:11,862 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-15 12:09:11,862 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-15 12:09:11,863 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-15 12:09:11,863 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-15 12:09:11,864 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-15 12:09:11,864 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-15 12:09:11,865 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-15 12:09:11,866 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-15 12:09:11,866 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-15 12:09:11,867 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-15 12:09:11,867 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-15 12:09:11,868 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-15 12:09:11,868 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-15 12:09:11,869 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-15 12:09:11,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {61684#false} ~i~0 := 0;~cont_aux~0 := 0; {61684#false} is VALID [2022-04-15 12:09:11,869 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-15 12:09:11,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {61684#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61684#false} is VALID [2022-04-15 12:09:11,869 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-15 12:09:11,869 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-15 12:09:11,869 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-15 12:09:11,869 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-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {61684#false} assume !(~j~0 % 4294967296 < 2); {61684#false} is VALID [2022-04-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {61684#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {61684#false} is VALID [2022-04-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,870 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-15 12:09:11,871 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-15 12:09:11,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {61684#false} assume !(~j~0 % 4294967296 < 2); {61684#false} is VALID [2022-04-15 12:09:11,871 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-15 12:09:11,871 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-15 12:09:11,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {61684#false} assume !(0 != #t~mem11);havoc #t~mem11; {61684#false} is VALID [2022-04-15 12:09:11,871 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-15 12:09:11,871 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-15 12:09:11,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-15 12:09:11,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-15 12:09:11,872 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-15 12:09:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:09:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961700492] [2022-04-15 12:09:11,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961700492] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:09:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959024682] [2022-04-15 12:09:11,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:09:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:09:11,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:09:11,876 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-15 12:09:11,880 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-15 12:09:12,083 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:09:12,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:09:12,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:09:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:12,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:09:12,690 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-15 12:09:12,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {61683#true} call ULTIMATE.init(); {61683#true} is VALID [2022-04-15 12:09:12,713 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-15 12:09:12,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-15 12:09:12,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-15 12:09:12,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-15 12:09:12,714 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-15 12:09:12,714 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-15 12:09:12,715 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-15 12:09:12,715 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-15 12:09:12,716 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-15 12:09:12,716 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-15 12:09:12,716 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-15 12:09:12,716 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-15 12:09:12,717 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-15 12:09:12,717 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-15 12:09:12,717 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-15 12:09:12,718 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-15 12:09:12,718 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-15 12:09:12,718 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-15 12:09:12,719 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-15 12:09:12,719 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-15 12:09:12,719 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-15 12:09:12,720 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-15 12:09:12,720 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-15 12:09:12,720 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-15 12:09:12,721 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-15 12:09:12,721 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-15 12:09:12,722 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-15 12:09:12,722 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-15 12:09:12,722 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-15 12:09:12,723 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-15 12:09:12,723 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-15 12:09:12,724 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-15 12:09:12,724 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-15 12:09:12,724 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-15 12:09:12,725 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-15 12:09:12,725 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-15 12:09:12,726 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-15 12:09:12,726 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-15 12:09:12,726 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-15 12:09:12,727 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-15 12:09:12,727 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-15 12:09:12,728 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-15 12:09:12,728 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-15 12:09:12,728 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-15 12:09:12,729 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-15 12:09:12,729 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-15 12:09:12,730 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-15 12:09:12,730 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-15 12:09:12,730 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-15 12:09:12,731 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-15 12:09:12,731 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-15 12:09:12,732 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-15 12:09:12,732 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-15 12:09:12,732 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-15 12:09:12,733 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-15 12:09:12,733 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-15 12:09:12,734 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-15 12:09:12,734 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-15 12:09:12,735 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-15 12:09:12,735 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-15 12:09:12,735 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-15 12:09:12,736 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-15 12:09:12,736 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-15 12:09:12,736 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-15 12:09:12,737 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-15 12:09:12,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-15 12:09:12,737 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-15 12:09:12,737 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-15 12:09:12,737 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-15 12:09:12,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:09:12,975 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:09:12,976 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-15 12:09:13,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {61684#false} assume !false; {61684#false} is VALID [2022-04-15 12:09:13,080 INFO L290 TraceCheckUtils]: 67: Hoare triple {61684#false} assume 0 == ~cond; {61684#false} is VALID [2022-04-15 12:09:13,080 INFO L290 TraceCheckUtils]: 66: Hoare triple {61684#false} ~cond := #in~cond; {61684#false} is VALID [2022-04-15 12:09:13,080 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-15 12:09:13,081 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-15 12:09:13,081 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-15 12:09:13,082 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-15 12:09:13,083 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-15 12:09:13,083 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-15 12:09:13,084 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-15 12:09:13,084 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-15 12:09:13,085 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-15 12:09:13,085 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-15 12:09:13,086 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-15 12:09:13,086 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-15 12:09:13,087 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-15 12:09:13,088 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-15 12:09:13,088 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-15 12:09:13,089 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-15 12:09:13,089 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-15 12:09:13,089 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-15 12:09:13,089 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-15 12:09:13,090 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-15 12:09:13,090 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-15 12:09:13,090 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-15 12:09:13,091 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-15 12:09:13,091 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-15 12:09:13,091 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-15 12:09:13,092 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-15 12:09:13,092 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-15 12:09:13,092 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-15 12:09:13,092 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-15 12:09:13,093 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-15 12:09:13,093 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-15 12:09:13,093 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-15 12:09:13,094 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-15 12:09:13,094 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-15 12:09:13,094 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-15 12:09:13,094 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-15 12:09:13,095 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-15 12:09:13,095 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-15 12:09:13,095 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-15 12:09:13,096 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-15 12:09:13,096 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-15 12:09:13,096 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-15 12:09:13,097 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-15 12:09:13,097 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-15 12:09:13,097 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-15 12:09:13,098 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-15 12:09:13,098 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {61683#true} assume !(~i~0 % 4294967296 < 5); {61683#true} is VALID [2022-04-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,099 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-15 12:09:13,100 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-15 12:09:13,100 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-15 12:09:13,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {61683#true} call #t~ret17 := main(); {61683#true} is VALID [2022-04-15 12:09:13,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61683#true} {61683#true} #133#return; {61683#true} is VALID [2022-04-15 12:09:13,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {61683#true} assume true; {61683#true} is VALID [2022-04-15 12:09:13,100 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-15 12:09:13,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {61683#true} call ULTIMATE.init(); {61683#true} is VALID [2022-04-15 12:09:13,100 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-15 12:09:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959024682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:09:13,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:09:13,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 31 [2022-04-15 12:09:13,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:09:13,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087364498] [2022-04-15 12:09:13,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087364498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:09:13,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:09:13,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:09:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814263286] [2022-04-15 12:09:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:09:13,102 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-15 12:09:13,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:09:13,102 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-15 12:09:13,132 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-15 12:09:13,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:09:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:13,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:09:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:09:13,133 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-15 12:09:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:32,363 INFO L93 Difference]: Finished difference Result 1564 states and 1815 transitions. [2022-04-15 12:09:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:09:32,363 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-15 12:09:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:09:32,364 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-15 12:09:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2022-04-15 12:09:32,365 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-15 12:09:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 193 transitions. [2022-04-15 12:09:32,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 193 transitions. [2022-04-15 12:09:32,514 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-15 12:09:32,598 INFO L225 Difference]: With dead ends: 1564 [2022-04-15 12:09:32,598 INFO L226 Difference]: Without dead ends: 1515 [2022-04-15 12:09:32,598 INFO L912 BasicCegarLoop]: 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-15 12:09:32,599 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 228 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:09:32,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 134 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:09:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-15 12:09:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 398. [2022-04-15 12:09:37,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:09:37,043 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-15 12:09:37,043 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-15 12:09:37,043 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-15 12:09:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:37,107 INFO L93 Difference]: Finished difference Result 1515 states and 1759 transitions. [2022-04-15 12:09:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2022-04-15 12:09:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:37,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:37,109 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-15 12:09:37,109 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-15 12:09:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:09:37,175 INFO L93 Difference]: Finished difference Result 1515 states and 1759 transitions. [2022-04-15 12:09:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1759 transitions. [2022-04-15 12:09:37,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:09:37,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:09:37,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:09:37,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:09:37,176 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-15 12:09:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 460 transitions. [2022-04-15 12:09:37,184 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 460 transitions. Word has length 69 [2022-04-15 12:09:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:09:37,184 INFO L478 AbstractCegarLoop]: Abstraction has 398 states and 460 transitions. [2022-04-15 12:09:37,184 INFO L479 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-15 12:09:37,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 398 states and 460 transitions. [2022-04-15 12:09:39,336 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-15 12:09:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 460 transitions. [2022-04-15 12:09:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:09:39,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:09:39,337 INFO L499 BasicCegarLoop]: 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-15 12:09:39,353 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-15 12:09:39,539 WARN L460 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-15 12:09:39,539 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:09:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:09:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1485591660, now seen corresponding path program 19 times [2022-04-15 12:09:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:39,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661607501] [2022-04-15 12:09:39,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:09:39,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:09:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1485591660, now seen corresponding path program 20 times [2022-04-15 12:09:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:09:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281971958] [2022-04-15 12:09:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:09:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:09:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:09:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:39,758 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-15 12:09:39,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-15 12:09:39,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-15 12:09:39,759 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-15 12:09:39,759 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-15 12:09:39,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-15 12:09:39,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-15 12:09:39,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-15 12:09:39,759 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-15 12:09:39,759 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 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-15 12:09:39,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {69102#true} assume !(~i~0 % 4294967296 < 5); {69102#true} is VALID [2022-04-15 12:09:39,760 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-15 12:09:39,761 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-15 12:09:39,761 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-15 12:09:39,761 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-15 12:09:39,762 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-15 12:09:39,762 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-15 12:09:39,763 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-15 12:09:39,763 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-15 12:09:39,764 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-15 12:09:39,764 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-15 12:09:39,765 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-15 12:09:39,765 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-15 12:09:39,766 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-15 12:09:39,766 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-15 12:09:39,767 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-15 12:09:39,767 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-15 12:09:39,768 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-15 12:09:39,768 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-15 12:09:39,769 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-15 12:09:39,769 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-15 12:09:39,770 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-15 12:09:39,770 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-15 12:09:39,771 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-15 12:09:39,771 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-15 12:09:39,772 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-15 12:09:39,772 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-15 12:09:39,773 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-15 12:09:39,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {69103#false} ~i~0 := 0;~cont_aux~0 := 0; {69103#false} is VALID [2022-04-15 12:09:39,773 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-15 12:09:39,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {69103#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69103#false} is VALID [2022-04-15 12:09:39,773 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-15 12:09:39,773 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-15 12:09:39,773 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-15 12:09:39,773 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-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {69103#false} assume !(~j~0 % 4294967296 < 2); {69103#false} is VALID [2022-04-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {69103#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {69103#false} is VALID [2022-04-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,774 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-15 12:09:39,775 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-15 12:09:39,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {69103#false} assume !(~j~0 % 4294967296 < 2); {69103#false} is VALID [2022-04-15 12:09:39,775 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-15 12:09:39,775 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-15 12:09:39,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {69103#false} assume !(0 != #t~mem11);havoc #t~mem11; {69103#false} is VALID [2022-04-15 12:09:39,775 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-15 12:09:39,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-15 12:09:39,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-15 12:09:39,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-15 12:09:39,776 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-15 12:09:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:09:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281971958] [2022-04-15 12:09:39,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281971958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:09:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123706406] [2022-04-15 12:09:39,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:09:39,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:09:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:09:39,778 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-15 12:09:39,780 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-15 12:09:39,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:09:39,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:09:39,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:09:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:09:39,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:09:40,535 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-15 12:09:40,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {69102#true} call ULTIMATE.init(); {69102#true} is VALID [2022-04-15 12:09:40,554 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-15 12:09:40,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-15 12:09:40,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-15 12:09:40,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-15 12:09:40,555 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-15 12:09:40,556 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-15 12:09:40,556 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-15 12:09:40,556 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-15 12:09:40,557 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-15 12:09:40,558 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-15 12:09:40,558 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-15 12:09:40,559 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-15 12:09:40,559 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-15 12:09:40,559 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-15 12:09:40,559 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-15 12:09:40,560 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-15 12:09:40,560 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-15 12:09:40,560 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-15 12:09:40,561 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-15 12:09:40,561 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-15 12:09:40,561 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-15 12:09:40,562 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-15 12:09:40,562 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-15 12:09:40,563 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-15 12:09:40,563 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-15 12:09:40,563 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-15 12:09:40,564 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-15 12:09:40,564 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-15 12:09:40,564 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-15 12:09:40,565 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-15 12:09:40,565 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-15 12:09:40,565 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-15 12:09:40,566 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-15 12:09:40,566 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-15 12:09:40,567 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-15 12:09:40,567 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-15 12:09:40,567 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-15 12:09:40,568 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-15 12:09:40,568 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-15 12:09:40,569 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-15 12:09:40,569 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-15 12:09:40,569 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-15 12:09:40,570 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-15 12:09:40,570 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-15 12:09:40,570 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-15 12:09:40,571 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-15 12:09:40,571 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-15 12:09:40,572 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-15 12:09:40,572 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-15 12:09:40,573 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-15 12:09:40,573 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-15 12:09:40,573 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-15 12:09:40,574 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-15 12:09:40,574 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-15 12:09:40,574 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-15 12:09:40,575 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-15 12:09:40,575 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-15 12:09:40,576 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-15 12:09:40,576 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-15 12:09:40,577 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-15 12:09:40,577 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-15 12:09:40,577 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-15 12:09:40,578 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-15 12:09:40,578 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-15 12:09:40,578 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-15 12:09:40,579 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-15 12:09:40,579 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-15 12:09:40,579 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-15 12:09:40,579 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-15 12:09:40,579 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-15 12:09:40,579 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-15 12:09:40,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:09:40,818 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:09:40,818 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-15 12:09:40,916 INFO L290 TraceCheckUtils]: 70: Hoare triple {69103#false} assume !false; {69103#false} is VALID [2022-04-15 12:09:40,916 INFO L290 TraceCheckUtils]: 69: Hoare triple {69103#false} assume 0 == ~cond; {69103#false} is VALID [2022-04-15 12:09:40,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {69103#false} ~cond := #in~cond; {69103#false} is VALID [2022-04-15 12:09:40,917 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-15 12:09:40,917 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-15 12:09:40,917 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-15 12:09:40,918 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-15 12:09:40,918 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-15 12:09:40,919 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-15 12:09:40,919 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-15 12:09:40,919 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-15 12:09:40,920 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-15 12:09:40,920 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-15 12:09:40,921 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-15 12:09:40,921 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-15 12:09:40,921 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-15 12:09:40,922 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-15 12:09:40,922 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-15 12:09:40,923 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-15 12:09:40,923 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-15 12:09:40,923 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-15 12:09:40,923 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-15 12:09:40,924 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-15 12:09:40,924 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-15 12:09:40,924 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-15 12:09:40,925 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-15 12:09:40,925 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-15 12:09:40,925 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-15 12:09:40,926 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-15 12:09:40,926 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-15 12:09:40,926 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-15 12:09:40,926 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-15 12:09:40,927 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-15 12:09:40,927 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-15 12:09:40,928 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-15 12:09:40,929 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-15 12:09:40,929 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-15 12:09:40,929 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-15 12:09:40,929 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-15 12:09:40,930 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-15 12:09:40,930 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-15 12:09:40,930 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-15 12:09:40,931 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-15 12:09:40,931 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-15 12:09:40,931 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-15 12:09:40,931 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-15 12:09:40,932 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-15 12:09:40,933 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-15 12:09:40,933 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-15 12:09:40,933 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-15 12:09:40,934 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-15 12:09:40,934 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-15 12:09:40,934 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-15 12:09:40,935 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-15 12:09:40,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {69102#true} assume !(~i~0 % 4294967296 < 5); {69102#true} is VALID [2022-04-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 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-15 12:09:40,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {69102#true} call #t~ret17 := main(); {69102#true} is VALID [2022-04-15 12:09:40,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69102#true} {69102#true} #133#return; {69102#true} is VALID [2022-04-15 12:09:40,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {69102#true} assume true; {69102#true} is VALID [2022-04-15 12:09:40,936 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-15 12:09:40,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {69102#true} call ULTIMATE.init(); {69102#true} is VALID [2022-04-15 12:09:40,936 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-15 12:09:40,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123706406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:09:40,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:09:40,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 32 [2022-04-15 12:09:40,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:09:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661607501] [2022-04-15 12:09:40,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661607501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:09:40,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:09:40,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:09:40,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305328930] [2022-04-15 12:09:40,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:09:40,937 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-15 12:09:40,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:09:40,938 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-15 12:09:40,969 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-15 12:09:40,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:09:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:09:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:09:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:09:40,970 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-15 12:10:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:05,401 INFO L93 Difference]: Finished difference Result 1832 states and 2127 transitions. [2022-04-15 12:10:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:10:05,402 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-15 12:10:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:05,402 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-15 12:10:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2022-04-15 12:10:05,403 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-15 12:10:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2022-04-15 12:10:05,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 216 transitions. [2022-04-15 12:10:05,573 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-15 12:10:05,701 INFO L225 Difference]: With dead ends: 1832 [2022-04-15 12:10:05,701 INFO L226 Difference]: Without dead ends: 1783 [2022-04-15 12:10:05,702 INFO L912 BasicCegarLoop]: 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-15 12:10:05,702 INFO L913 BasicCegarLoop]: 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-15 12:10:05,703 INFO L914 BasicCegarLoop]: 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-15 12:10:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-04-15 12:10:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 400. [2022-04-15 12:10:10,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:10:10,453 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-15 12:10:10,453 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-15 12:10:10,453 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-15 12:10:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:10,548 INFO L93 Difference]: Finished difference Result 1783 states and 2071 transitions. [2022-04-15 12:10:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2071 transitions. [2022-04-15 12:10:10,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:10,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:10,550 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-15 12:10:10,551 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-15 12:10:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:10,651 INFO L93 Difference]: Finished difference Result 1783 states and 2071 transitions. [2022-04-15 12:10:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2071 transitions. [2022-04-15 12:10:10,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:10,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:10,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:10:10,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:10:10,653 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-15 12:10:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 463 transitions. [2022-04-15 12:10:10,661 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 463 transitions. Word has length 71 [2022-04-15 12:10:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:10:10,661 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 463 transitions. [2022-04-15 12:10:10,661 INFO L479 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-15 12:10:10,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 463 transitions. [2022-04-15 12:10:12,962 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-15 12:10:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 463 transitions. [2022-04-15 12:10:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 12:10:12,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:10:12,964 INFO L499 BasicCegarLoop]: 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-15 12:10:12,983 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-15 12:10:13,164 WARN L460 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-15 12:10:13,164 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:10:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:10:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash 930201970, now seen corresponding path program 21 times [2022-04-15 12:10:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:13,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221471212] [2022-04-15 12:10:13,168 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:13,169 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:10:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 930201970, now seen corresponding path program 22 times [2022-04-15 12:10:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:10:13,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893015528] [2022-04-15 12:10:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:10:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:10:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:10:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:13,859 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-15 12:10:13,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-15 12:10:13,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-15 12:10:13,860 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-15 12:10:13,860 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-15 12:10:13,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-15 12:10:13,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-15 12:10:13,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-15 12:10:13,862 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-15 12:10:13,862 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-15 12:10:13,863 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-15 12:10:13,863 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-15 12:10:13,864 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-15 12:10:13,864 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-15 12:10:13,865 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-15 12:10:13,865 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-15 12:10:13,865 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-15 12:10:13,866 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-15 12:10:13,866 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-15 12:10:13,867 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-15 12:10:13,867 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-15 12:10:13,868 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-15 12:10:13,868 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-15 12:10:13,869 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-15 12:10:13,869 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-15 12:10:13,869 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-15 12:10:13,870 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-15 12:10:13,870 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-15 12:10:13,871 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-15 12:10:13,871 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-15 12:10:13,871 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-15 12:10:13,872 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-15 12:10:13,872 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-15 12:10:13,873 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-15 12:10:13,873 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-15 12:10:13,874 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-15 12:10:13,874 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-15 12:10:13,875 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-15 12:10:13,876 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-15 12:10:13,877 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-15 12:10:13,877 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-15 12:10:13,878 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-15 12:10:13,879 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-15 12:10:13,879 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-15 12:10:13,880 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-15 12:10:13,880 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-15 12:10:13,881 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-15 12:10:13,881 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-15 12:10:13,882 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-15 12:10:13,882 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-15 12:10:13,883 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-15 12:10:13,883 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-15 12:10:13,884 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-15 12:10:13,884 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-15 12:10:13,885 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-15 12:10:13,885 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-15 12:10:13,886 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-15 12:10:13,886 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-15 12:10:13,887 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-15 12:10:13,890 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-15 12:10:13,890 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-15 12:10:13,892 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-15 12:10:13,892 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-15 12:10:13,892 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-15 12:10:13,892 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-15 12:10:13,892 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-15 12:10:13,892 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-15 12:10:13,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-15 12:10:13,893 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-15 12:10:13,893 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-15 12:10:13,893 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-15 12:10:13,893 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-15 12:10:13,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-15 12:10:13,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-15 12:10:13,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-15 12:10:13,894 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-15 12:10:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:10:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893015528] [2022-04-15 12:10:13,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893015528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:10:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580688671] [2022-04-15 12:10:13,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:10:13,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:13,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:10:13,900 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-15 12:10:13,903 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-15 12:10:14,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:10:14,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:10:14,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:10:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:14,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:10:14,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:10:14,644 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-15 12:10:14,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {77612#true} call ULTIMATE.init(); {77612#true} is VALID [2022-04-15 12:10:14,670 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-15 12:10:14,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-15 12:10:14,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-15 12:10:14,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-15 12:10:14,671 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-15 12:10:14,672 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-15 12:10:14,672 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-15 12:10:14,673 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-15 12:10:14,673 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-15 12:10:14,673 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-15 12:10:14,674 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-15 12:10:14,674 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-15 12:10:14,674 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-15 12:10:14,675 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-15 12:10:14,675 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-15 12:10:14,676 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-15 12:10:14,676 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-15 12:10:14,676 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-15 12:10:14,677 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-15 12:10:14,677 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-15 12:10:14,677 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-15 12:10:14,678 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-15 12:10:14,678 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-15 12:10:14,678 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-15 12:10:14,679 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-15 12:10:14,679 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-15 12:10:14,680 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-15 12:10:14,680 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-15 12:10:14,680 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-15 12:10:14,681 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-15 12:10:14,681 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-15 12:10:14,681 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-15 12:10:14,682 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-15 12:10:14,682 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-15 12:10:14,683 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-15 12:10:14,683 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-15 12:10:14,684 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-15 12:10:14,684 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-15 12:10:14,684 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-15 12:10:14,685 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-15 12:10:14,685 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-15 12:10:14,686 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-15 12:10:14,686 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-15 12:10:14,686 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-15 12:10:14,687 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-15 12:10:14,687 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-15 12:10:14,688 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-15 12:10:14,688 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-15 12:10:14,689 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-15 12:10:14,689 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-15 12:10:14,689 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-15 12:10:14,690 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-15 12:10:14,690 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-15 12:10:14,691 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-15 12:10:14,691 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-15 12:10:14,691 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-15 12:10:14,692 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-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-15 12:10:14,693 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-15 12:10:14,693 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-15 12:10:14,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-15 12:10:14,693 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-15 12:10:14,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-15 12:10:14,694 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-15 12:10:14,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-15 12:10:14,694 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-15 12:10:14,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:10:14,932 INFO L356 Elim1Store]: treesize reduction 29, result has 68.1 percent of original size [2022-04-15 12:10:14,932 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-15 12:10:15,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {77613#false} assume !false; {77613#false} is VALID [2022-04-15 12:10:15,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {77613#false} assume 0 == ~cond; {77613#false} is VALID [2022-04-15 12:10:15,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {77613#false} ~cond := #in~cond; {77613#false} is VALID [2022-04-15 12:10:15,172 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-15 12:10:15,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {77613#false} assume !(0 != #t~mem11);havoc #t~mem11; {77613#false} is VALID [2022-04-15 12:10:15,172 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-15 12:10:15,172 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-15 12:10:15,172 INFO L290 TraceCheckUtils]: 64: Hoare triple {77613#false} assume !(~j~0 % 4294967296 < 2); {77613#false} is VALID [2022-04-15 12:10:15,172 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-15 12:10:15,172 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-15 12:10:15,173 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-15 12:10:15,173 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-15 12:10:15,173 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-15 12:10:15,173 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-15 12:10:15,174 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-15 12:10:15,174 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-15 12:10:15,175 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-15 12:10:15,175 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-15 12:10:15,176 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-15 12:10:15,176 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-15 12:10:15,177 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-15 12:10:15,177 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-15 12:10:15,177 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-15 12:10:15,178 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-15 12:10:15,178 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-15 12:10:15,178 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-15 12:10:15,179 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-15 12:10:15,179 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-15 12:10:15,180 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-15 12:10:15,180 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-15 12:10:15,180 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-15 12:10:15,181 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-15 12:10:15,181 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-15 12:10:15,182 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-15 12:10:15,182 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-15 12:10:15,182 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-15 12:10:15,183 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-15 12:10:15,183 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-15 12:10:15,184 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-15 12:10:15,184 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-15 12:10:15,184 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-15 12:10:15,184 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-15 12:10:15,185 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-15 12:10:15,185 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-15 12:10:15,185 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {77612#true} assume !(0 != #t~mem4);havoc #t~mem4; {77612#true} is VALID [2022-04-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,186 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-15 12:10:15,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {77612#true} assume !(~i~0 % 4294967296 < 5); {77612#true} is VALID [2022-04-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 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-15 12:10:15,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {77612#true} call #t~ret17 := main(); {77612#true} is VALID [2022-04-15 12:10:15,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77612#true} {77612#true} #133#return; {77612#true} is VALID [2022-04-15 12:10:15,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {77612#true} assume true; {77612#true} is VALID [2022-04-15 12:10:15,188 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-15 12:10:15,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {77612#true} call ULTIMATE.init(); {77612#true} is VALID [2022-04-15 12:10:15,188 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-15 12:10:15,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580688671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:10:15,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:10:15,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 29 [2022-04-15 12:10:15,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:10:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221471212] [2022-04-15 12:10:15,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221471212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:10:15,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:10:15,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:10:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267783958] [2022-04-15 12:10:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:10:15,190 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-15 12:10:15,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:10:15,190 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-15 12:10:15,235 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-15 12:10:15,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:10:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:10:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:10:15,236 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-15 12:10:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:25,490 INFO L93 Difference]: Finished difference Result 770 states and 892 transitions. [2022-04-15 12:10:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:10:25,490 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-15 12:10:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:25,491 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-15 12:10:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-04-15 12:10:25,492 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-15 12:10:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-04-15 12:10:25,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 134 transitions. [2022-04-15 12:10:25,606 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-15 12:10:25,624 INFO L225 Difference]: With dead ends: 770 [2022-04-15 12:10:25,625 INFO L226 Difference]: Without dead ends: 716 [2022-04-15 12:10:25,625 INFO L912 BasicCegarLoop]: 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-15 12:10:25,626 INFO L913 BasicCegarLoop]: 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-15 12:10:25,626 INFO L914 BasicCegarLoop]: 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-15 12:10:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-04-15 12:10:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 569. [2022-04-15 12:10:32,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:10:32,581 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-15 12:10:32,582 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-15 12:10:32,582 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-15 12:10:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:32,597 INFO L93 Difference]: Finished difference Result 716 states and 825 transitions. [2022-04-15 12:10:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 825 transitions. [2022-04-15 12:10:32,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:32,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:32,598 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-15 12:10:32,599 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-15 12:10:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:32,613 INFO L93 Difference]: Finished difference Result 716 states and 825 transitions. [2022-04-15 12:10:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 825 transitions. [2022-04-15 12:10:32,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:10:32,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:10:32,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:10:32,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:10:32,615 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-15 12:10:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 659 transitions. [2022-04-15 12:10:32,630 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 659 transitions. Word has length 72 [2022-04-15 12:10:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:10:32,631 INFO L478 AbstractCegarLoop]: Abstraction has 569 states and 659 transitions. [2022-04-15 12:10:32,631 INFO L479 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-15 12:10:32,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 569 states and 659 transitions. [2022-04-15 12:10:35,828 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-15 12:10:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 659 transitions. [2022-04-15 12:10:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 12:10:35,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:10:35,829 INFO L499 BasicCegarLoop]: 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-15 12:10:35,846 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-15 12:10:36,031 WARN L460 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-15 12:10:36,031 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:10:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:10:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash -188563146, now seen corresponding path program 23 times [2022-04-15 12:10:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:36,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790576153] [2022-04-15 12:10:36,036 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:10:36,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:10:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash -188563146, now seen corresponding path program 24 times [2022-04-15 12:10:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:10:36,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398750549] [2022-04-15 12:10:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:10:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:10:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:10:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:36,941 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-15 12:10:36,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-15 12:10:36,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-15 12:10:36,947 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-15 12:10:36,947 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-15 12:10:36,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-15 12:10:36,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-15 12:10:36,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-15 12:10:36,948 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-15 12:10:36,949 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-15 12:10:36,949 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-15 12:10:36,950 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-15 12:10:36,950 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-15 12:10:36,951 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-15 12:10:36,951 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-15 12:10:36,952 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-15 12:10:36,952 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-15 12:10:36,953 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-15 12:10:36,953 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-15 12:10:36,954 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-15 12:10:36,954 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-15 12:10:36,955 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-15 12:10:36,955 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-15 12:10:36,956 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-15 12:10:36,956 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-15 12:10:36,957 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-15 12:10:36,958 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-15 12:10:36,958 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-15 12:10:36,959 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-15 12:10:36,959 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-15 12:10:36,960 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-15 12:10:36,960 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-15 12:10:36,961 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-15 12:10:36,961 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-15 12:10:36,962 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-15 12:10:36,962 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-15 12:10:36,963 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-15 12:10:36,964 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-15 12:10:36,964 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-15 12:10:36,965 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-15 12:10:36,966 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-15 12:10:36,966 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-15 12:10:36,967 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-15 12:10:36,968 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-15 12:10:36,969 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-15 12:10:36,970 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-15 12:10:36,970 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-15 12:10:36,971 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-15 12:10:36,971 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-15 12:10:36,972 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-15 12:10:36,972 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-15 12:10:36,973 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-15 12:10:36,974 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-15 12:10:36,974 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-15 12:10:36,975 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-15 12:10:36,975 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-15 12:10:36,975 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-15 12:10:36,976 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-15 12:10:36,976 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-15 12:10:36,977 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-15 12:10:36,977 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-15 12:10:36,978 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-15 12:10:36,978 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-15 12:10:36,979 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-15 12:10:36,980 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-15 12:10:36,980 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-15 12:10:36,980 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-15 12:10:36,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-15 12:10:36,980 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-15 12:10:36,980 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-15 12:10:36,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-15 12:10:36,981 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-15 12:10:36,981 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-15 12:10:36,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-15 12:10:36,981 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-15 12:10:36,981 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-15 12:10:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:10:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398750549] [2022-04-15 12:10:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398750549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:10:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177286105] [2022-04-15 12:10:36,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:10:36,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:10:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:10:36,983 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-15 12:10:36,983 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-15 12:10:37,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:10:37,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:10:37,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:10:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:10:37,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:10:37,815 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 12:10:37,815 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-15 12:10:37,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {82207#true} call ULTIMATE.init(); {82207#true} is VALID [2022-04-15 12:10:37,840 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-15 12:10:37,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-15 12:10:37,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-15 12:10:37,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-15 12:10:37,841 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-15 12:10:37,841 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-15 12:10:37,842 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-15 12:10:37,842 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-15 12:10:37,842 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-15 12:10:37,843 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-15 12:10:37,843 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-15 12:10:37,844 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-15 12:10:37,844 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-15 12:10:37,844 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-15 12:10:37,845 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-15 12:10:37,845 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-15 12:10:37,845 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-15 12:10:37,846 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-15 12:10:37,846 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-15 12:10:37,847 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-15 12:10:37,847 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-15 12:10:37,847 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-15 12:10:37,848 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-15 12:10:37,848 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-15 12:10:37,848 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-15 12:10:37,849 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-15 12:10:37,849 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-15 12:10:37,849 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-15 12:10:37,850 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-15 12:10:37,850 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-15 12:10:37,851 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-15 12:10:37,851 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-15 12:10:37,851 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-15 12:10:37,852 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-15 12:10:37,852 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-15 12:10:37,853 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-15 12:10:37,853 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-15 12:10:37,853 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-15 12:10:37,854 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-15 12:10:37,854 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-15 12:10:37,855 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-15 12:10:37,855 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-15 12:10:37,855 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-15 12:10:37,856 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-15 12:10:37,856 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-15 12:10:37,857 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-15 12:10:37,857 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-15 12:10:37,858 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-15 12:10:37,858 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-15 12:10:37,858 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-15 12:10:37,859 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-15 12:10:37,859 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-15 12:10:37,860 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-15 12:10:37,860 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-15 12:10:37,860 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-15 12:10:37,861 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-15 12:10:37,861 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-15 12:10:37,862 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-15 12:10:37,862 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-15 12:10:37,863 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-15 12:10:37,863 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-15 12:10:37,863 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-15 12:10:37,863 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-15 12:10:37,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-15 12:10:37,864 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-15 12:10:37,864 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-15 12:10:37,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-15 12:10:37,864 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-15 12:10:37,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-15 12:10:37,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-15 12:10:37,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-15 12:10:37,864 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-15 12:10:37,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:10:38,156 INFO L356 Elim1Store]: treesize reduction 35, result has 63.9 percent of original size [2022-04-15 12:10:38,156 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-15 12:10:38,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {82208#false} assume !false; {82208#false} is VALID [2022-04-15 12:10:38,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {82208#false} assume 0 == ~cond; {82208#false} is VALID [2022-04-15 12:10:38,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {82208#false} ~cond := #in~cond; {82208#false} is VALID [2022-04-15 12:10:38,479 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-15 12:10:38,479 INFO L290 TraceCheckUtils]: 67: Hoare triple {82208#false} assume !(0 != #t~mem11);havoc #t~mem11; {82208#false} is VALID [2022-04-15 12:10:38,479 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-15 12:10:38,479 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-15 12:10:38,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {82208#false} assume !(~j~0 % 4294967296 < 2); {82208#false} is VALID [2022-04-15 12:10:38,479 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-15 12:10:38,480 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-15 12:10:38,480 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-15 12:10:38,481 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-15 12:10:38,481 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-15 12:10:38,482 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-15 12:10:38,482 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-15 12:10:38,482 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-15 12:10:38,483 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-15 12:10:38,483 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-15 12:10:38,484 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-15 12:10:38,484 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-15 12:10:38,485 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-15 12:10:38,485 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-15 12:10:38,486 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-15 12:10:38,486 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-15 12:10:38,486 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-15 12:10:38,487 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-15 12:10:38,487 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-15 12:10:38,488 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-15 12:10:38,488 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-15 12:10:38,488 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-15 12:10:38,489 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-15 12:10:38,489 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-15 12:10:38,490 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-15 12:10:38,490 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-15 12:10:38,491 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-15 12:10:38,491 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-15 12:10:38,491 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-15 12:10:38,492 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-15 12:10:38,492 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-15 12:10:38,493 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-15 12:10:38,493 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-15 12:10:38,493 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-15 12:10:38,493 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-15 12:10:38,494 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-15 12:10:38,494 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-15 12:10:38,494 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-15 12:10:38,495 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-15 12:10:38,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {82207#true} assume !(0 != #t~mem4);havoc #t~mem4; {82207#true} is VALID [2022-04-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {82207#true} assume !(~i~0 % 4294967296 < 5); {82207#true} is VALID [2022-04-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,495 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 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-15 12:10:38,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {82207#true} call #t~ret17 := main(); {82207#true} is VALID [2022-04-15 12:10:38,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82207#true} {82207#true} #133#return; {82207#true} is VALID [2022-04-15 12:10:38,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {82207#true} assume true; {82207#true} is VALID [2022-04-15 12:10:38,496 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-15 12:10:38,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {82207#true} call ULTIMATE.init(); {82207#true} is VALID [2022-04-15 12:10:38,497 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-15 12:10:38,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177286105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:10:38,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:10:38,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 38 [2022-04-15 12:10:38,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:10:38,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790576153] [2022-04-15 12:10:38,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790576153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:10:38,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:10:38,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:10:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293859263] [2022-04-15 12:10:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:10:38,498 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-15 12:10:38,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:10:38,498 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-15 12:10:38,548 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-15 12:10:38,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:10:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:10:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:10:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1205, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:10:38,549 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-15 12:10:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:10:56,485 INFO L93 Difference]: Finished difference Result 1224 states and 1411 transitions. [2022-04-15 12:10:56,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:10:56,485 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-15 12:10:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:10:56,485 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-15 12:10:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 153 transitions. [2022-04-15 12:10:56,486 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-15 12:10:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 153 transitions. [2022-04-15 12:10:56,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 153 transitions. [2022-04-15 12:10:56,626 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-15 12:10:56,674 INFO L225 Difference]: With dead ends: 1224 [2022-04-15 12:10:56,674 INFO L226 Difference]: Without dead ends: 1161 [2022-04-15 12:10:56,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=2829, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:10:56,675 INFO L913 BasicCegarLoop]: 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-15 12:10:56,676 INFO L914 BasicCegarLoop]: 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-15 12:10:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-04-15 12:11:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 726. [2022-04-15 12:11:05,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:11:05,797 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-15 12:11:05,797 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-15 12:11:05,798 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-15 12:11:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:11:05,835 INFO L93 Difference]: Finished difference Result 1161 states and 1332 transitions. [2022-04-15 12:11:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1332 transitions. [2022-04-15 12:11:05,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:11:05,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:11:05,837 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-15 12:11:05,837 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-15 12:11:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:11:05,878 INFO L93 Difference]: Finished difference Result 1161 states and 1332 transitions. [2022-04-15 12:11:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1332 transitions. [2022-04-15 12:11:05,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:11:05,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:11:05,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:11:05,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:11:05,879 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-15 12:11:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 840 transitions. [2022-04-15 12:11:05,904 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 840 transitions. Word has length 72 [2022-04-15 12:11:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:11:05,904 INFO L478 AbstractCegarLoop]: Abstraction has 726 states and 840 transitions. [2022-04-15 12:11:05,904 INFO L479 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-15 12:11:05,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 726 states and 840 transitions. [2022-04-15 12:11:11,100 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-15 12:11:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 840 transitions. [2022-04-15 12:11:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 12:11:11,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:11:11,102 INFO L499 BasicCegarLoop]: 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-15 12:11:11,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 12:11:11,302 WARN L460 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-15 12:11:11,303 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:11:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:11:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 673002482, now seen corresponding path program 25 times [2022-04-15 12:11:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:11:11,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086066955] [2022-04-15 12:11:11,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:11:11,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:11:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 673002482, now seen corresponding path program 26 times [2022-04-15 12:11:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:11:11,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772950418] [2022-04-15 12:11:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:11:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:11:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:11:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:12,173 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-15 12:11:12,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-15 12:11:12,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-15 12:11:12,174 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-15 12:11:12,174 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-15 12:11:12,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-15 12:11:12,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-15 12:11:12,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-15 12:11:12,188 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-15 12:11:12,189 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-15 12:11:12,189 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-15 12:11:12,190 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-15 12:11:12,190 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-15 12:11:12,191 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-15 12:11:12,191 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-15 12:11:12,192 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-15 12:11:12,192 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-15 12:11:12,192 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-15 12:11:12,193 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-15 12:11:12,193 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-15 12:11:12,194 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-15 12:11:12,194 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-15 12:11:12,195 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-15 12:11:12,195 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-15 12:11:12,196 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-15 12:11:12,196 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-15 12:11:12,197 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-15 12:11:12,197 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-15 12:11:12,197 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-15 12:11:12,198 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-15 12:11:12,199 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-15 12:11:12,199 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-15 12:11:12,199 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-15 12:11:12,200 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-15 12:11:12,201 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-15 12:11:12,201 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-15 12:11:12,201 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-15 12:11:12,202 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-15 12:11:12,203 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-15 12:11:12,204 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-15 12:11:12,205 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-15 12:11:12,206 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-15 12:11:12,206 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-15 12:11:12,207 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-15 12:11:12,208 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-15 12:11:12,208 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-15 12:11:12,209 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-15 12:11:12,209 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-15 12:11:12,210 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-15 12:11:12,210 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-15 12:11:12,211 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-15 12:11:12,212 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-15 12:11:12,212 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-15 12:11:12,213 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-15 12:11:12,213 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-15 12:11:12,214 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-15 12:11:12,214 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-15 12:11:12,215 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-15 12:11:12,216 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-15 12:11:12,216 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-15 12:11:12,217 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-15 12:11:12,218 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-15 12:11:12,219 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-15 12:11:12,219 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-15 12:11:12,219 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-15 12:11:12,219 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-15 12:11:12,219 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-15 12:11:12,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-15 12:11:12,219 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-15 12:11:12,219 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-15 12:11:12,219 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-15 12:11:12,220 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-15 12:11:12,220 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-15 12:11:12,220 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-15 12:11:12,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-15 12:11:12,220 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-15 12:11:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:11:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772950418] [2022-04-15 12:11:12,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772950418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:11:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917338180] [2022-04-15 12:11:12,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:11:12,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:11:12,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:11:12,222 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-15 12:11:12,223 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-15 12:11:12,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:11:12,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:11:12,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:11:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:12,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:11:13,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:11:13,119 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-15 12:11:13,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {88941#true} call ULTIMATE.init(); {88941#true} is VALID [2022-04-15 12:11:13,151 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-15 12:11:13,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-15 12:11:13,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-15 12:11:13,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-15 12:11:13,152 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-15 12:11:13,153 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-15 12:11:13,153 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-15 12:11:13,154 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-15 12:11:13,154 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-15 12:11:13,155 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-15 12:11:13,155 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-15 12:11:13,156 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-15 12:11:13,156 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-15 12:11:13,157 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-15 12:11:13,157 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-15 12:11:13,157 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-15 12:11:13,158 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-15 12:11:13,158 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-15 12:11:13,159 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-15 12:11:13,159 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-15 12:11:13,160 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-15 12:11:13,160 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-15 12:11:13,161 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-15 12:11:13,161 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-15 12:11:13,161 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-15 12:11:13,162 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-15 12:11:13,163 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-15 12:11:13,163 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-15 12:11:13,163 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-15 12:11:13,164 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-15 12:11:13,164 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-15 12:11:13,165 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-15 12:11:13,165 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-15 12:11:13,166 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-15 12:11:13,166 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-15 12:11:13,167 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-15 12:11:13,168 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-15 12:11:13,168 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-15 12:11:13,169 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-15 12:11:13,169 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-15 12:11:13,170 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-15 12:11:13,170 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-15 12:11:13,171 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-15 12:11:13,171 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-15 12:11:13,171 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-15 12:11:13,172 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-15 12:11:13,172 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-15 12:11:13,173 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-15 12:11:13,174 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-15 12:11:13,174 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-15 12:11:13,175 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-15 12:11:13,175 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-15 12:11:13,176 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-15 12:11:13,176 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-15 12:11:13,177 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-15 12:11:13,177 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-15 12:11:13,178 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-15 12:11:13,179 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-15 12:11:13,179 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-15 12:11:13,179 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-15 12:11:13,179 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-15 12:11:13,179 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-15 12:11:13,179 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-15 12:11:13,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-15 12:11:13,179 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-15 12:11:13,180 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-15 12:11:13,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-15 12:11:13,180 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-15 12:11:13,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-15 12:11:13,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-15 12:11:13,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-15 12:11:13,180 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-15 12:11:13,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:11:13,472 INFO L356 Elim1Store]: treesize reduction 23, result has 74.7 percent of original size [2022-04-15 12:11:13,472 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-15 12:11:13,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {88942#false} assume !false; {88942#false} is VALID [2022-04-15 12:11:13,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {88942#false} assume 0 == ~cond; {88942#false} is VALID [2022-04-15 12:11:13,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {88942#false} ~cond := #in~cond; {88942#false} is VALID [2022-04-15 12:11:13,741 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-15 12:11:13,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {88942#false} assume !(0 != #t~mem11);havoc #t~mem11; {88942#false} is VALID [2022-04-15 12:11:13,741 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-15 12:11:13,742 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-15 12:11:13,742 INFO L290 TraceCheckUtils]: 64: Hoare triple {88942#false} assume !(~j~0 % 4294967296 < 2); {88942#false} is VALID [2022-04-15 12:11:13,742 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-15 12:11:13,742 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-15 12:11:13,742 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-15 12:11:13,742 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-15 12:11:13,742 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-15 12:11:13,743 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-15 12:11:13,743 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-15 12:11:13,744 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-15 12:11:13,745 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-15 12:11:13,745 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-15 12:11:13,746 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-15 12:11:13,746 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-15 12:11:13,747 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-15 12:11:13,747 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-15 12:11:13,748 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-15 12:11:13,748 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-15 12:11:13,749 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-15 12:11:13,749 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-15 12:11:13,750 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-15 12:11:13,750 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-15 12:11:13,751 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-15 12:11:13,751 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-15 12:11:13,752 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-15 12:11:13,752 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-15 12:11:13,753 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-15 12:11:13,753 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-15 12:11:13,753 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-15 12:11:13,754 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-15 12:11:13,755 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-15 12:11:13,755 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-15 12:11:13,756 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-15 12:11:13,756 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-15 12:11:13,756 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-15 12:11:13,757 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-15 12:11:13,757 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-15 12:11:13,757 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-15 12:11:13,758 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-15 12:11:13,758 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-15 12:11:13,759 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-15 12:11:13,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {88941#true} assume !(0 != #t~mem4);havoc #t~mem4; {88941#true} is VALID [2022-04-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,759 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-15 12:11:13,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {88941#true} assume !(~i~0 % 4294967296 < 5); {88941#true} is VALID [2022-04-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,760 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-15 12:11:13,761 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-15 12:11:13,761 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-15 12:11:13,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {88941#true} call #t~ret17 := main(); {88941#true} is VALID [2022-04-15 12:11:13,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88941#true} {88941#true} #133#return; {88941#true} is VALID [2022-04-15 12:11:13,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {88941#true} assume true; {88941#true} is VALID [2022-04-15 12:11:13,761 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-15 12:11:13,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {88941#true} call ULTIMATE.init(); {88941#true} is VALID [2022-04-15 12:11:13,761 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-15 12:11:13,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917338180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:11:13,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:11:13,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 27 [2022-04-15 12:11:13,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:11:13,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086066955] [2022-04-15 12:11:13,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086066955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:11:13,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:11:13,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:11:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989626787] [2022-04-15 12:11:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:11:13,763 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-15 12:11:13,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:11:13,763 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-15 12:11:13,815 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-15 12:11:13,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:11:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:11:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:11:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:11:13,817 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-15 12:11:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:11:31,396 INFO L93 Difference]: Finished difference Result 952 states and 1094 transitions. [2022-04-15 12:11:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:11:31,396 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-15 12:11:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:11:31,396 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-15 12:11:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 12:11:31,397 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-15 12:11:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 12:11:31,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 12:11:31,540 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-15 12:11:31,588 INFO L225 Difference]: With dead ends: 952 [2022-04-15 12:11:31,588 INFO L226 Difference]: Without dead ends: 908 [2022-04-15 12:11:31,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:11:31,591 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 171 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:11:31,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 63 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:11:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-04-15 12:11:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 760. [2022-04-15 12:11:43,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:11:43,396 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-15 12:11:43,397 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-15 12:11:43,397 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-15 12:11:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:11:43,423 INFO L93 Difference]: Finished difference Result 908 states and 1039 transitions. [2022-04-15 12:11:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1039 transitions. [2022-04-15 12:11:43,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:11:43,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:11:43,424 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-15 12:11:43,424 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-15 12:11:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:11:43,450 INFO L93 Difference]: Finished difference Result 908 states and 1039 transitions. [2022-04-15 12:11:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1039 transitions. [2022-04-15 12:11:43,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:11:43,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:11:43,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:11:43,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:11:43,451 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-15 12:11:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 874 transitions. [2022-04-15 12:11:43,474 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 874 transitions. Word has length 72 [2022-04-15 12:11:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:11:43,474 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 874 transitions. [2022-04-15 12:11:43,474 INFO L479 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-15 12:11:43,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 760 states and 874 transitions. [2022-04-15 12:11:48,457 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-15 12:11:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 874 transitions. [2022-04-15 12:11:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 12:11:48,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:11:48,459 INFO L499 BasicCegarLoop]: 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-15 12:11:48,484 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-15 12:11:48,659 WARN L460 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-15 12:11:48,660 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:11:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:11:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash 479223478, now seen corresponding path program 27 times [2022-04-15 12:11:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:11:48,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418410013] [2022-04-15 12:11:48,665 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:11:48,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:11:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash 479223478, now seen corresponding path program 28 times [2022-04-15 12:11:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:11:48,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106513937] [2022-04-15 12:11:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:11:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:11:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:11:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:50,330 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-15 12:11:50,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-15 12:11:50,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-15 12:11:50,331 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-15 12:11:50,331 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-15 12:11:50,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-15 12:11:50,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-15 12:11:50,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-15 12:11:50,332 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-15 12:11:50,333 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-15 12:11:50,333 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-15 12:11:50,334 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-15 12:11:50,334 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-15 12:11:50,335 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-15 12:11:50,335 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-15 12:11:50,336 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-15 12:11:50,336 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-15 12:11:50,337 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-15 12:11:50,337 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-15 12:11:50,337 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-15 12:11:50,338 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-15 12:11:50,338 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-15 12:11:50,339 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-15 12:11:50,339 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-15 12:11:50,340 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-15 12:11:50,340 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-15 12:11:50,341 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-15 12:11:50,341 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-15 12:11:50,342 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-15 12:11:50,342 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-15 12:11:50,343 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-15 12:11:50,344 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-15 12:11:50,344 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-15 12:11:50,345 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-15 12:11:50,345 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-15 12:11:50,346 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-15 12:11:50,346 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-15 12:11:50,347 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-15 12:11:50,348 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-15 12:11:50,348 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-15 12:11:50,349 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-15 12:11:50,350 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-15 12:11:50,351 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-15 12:11:50,352 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-15 12:11:50,353 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-15 12:11:50,353 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-15 12:11:50,354 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-15 12:11:50,355 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-15 12:11:50,355 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-15 12:11:50,356 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-15 12:11:50,356 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-15 12:11:50,357 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-15 12:11:50,357 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-15 12:11:50,358 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-15 12:11:50,358 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-15 12:11:50,359 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-15 12:11:50,360 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-15 12:11:50,360 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-15 12:11:50,361 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-15 12:11:50,361 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-15 12:11:50,362 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-15 12:11:50,362 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-15 12:11:50,363 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-15 12:11:50,364 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-15 12:11:50,365 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-15 12:11:50,366 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-15 12:11:50,366 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-15 12:11:50,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-15 12:11:50,366 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-15 12:11:50,366 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-15 12:11:50,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-15 12:11:50,366 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-15 12:11:50,367 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-15 12:11:50,367 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-15 12:11:50,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-15 12:11:50,367 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-15 12:11:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:11:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106513937] [2022-04-15 12:11:50,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106513937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:11:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956501742] [2022-04-15 12:11:50,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:11:50,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:11:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:11:50,369 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-15 12:11:50,370 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-15 12:11:50,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:11:50,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:11:50,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:11:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:11:50,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:11:51,420 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-15 12:11:51,421 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-15 12:11:51,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {94662#true} call ULTIMATE.init(); {94662#true} is VALID [2022-04-15 12:11:51,484 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-15 12:11:51,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-15 12:11:51,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-15 12:11:51,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-15 12:11:51,485 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-15 12:11:51,485 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-15 12:11:51,486 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-15 12:11:51,486 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-15 12:11:51,487 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-15 12:11:51,487 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-15 12:11:51,488 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-15 12:11:51,488 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-15 12:11:51,489 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-15 12:11:51,489 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-15 12:11:51,490 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-15 12:11:51,490 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-15 12:11:51,491 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-15 12:11:51,491 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-15 12:11:51,492 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-15 12:11:51,492 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-15 12:11:51,492 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-15 12:11:51,493 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-15 12:11:51,493 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-15 12:11:51,494 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-15 12:11:51,494 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-15 12:11:51,495 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-15 12:11:51,495 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-15 12:11:51,496 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-15 12:11:51,496 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-15 12:11:51,497 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-15 12:11:51,497 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-15 12:11:51,498 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-15 12:11:51,498 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-15 12:11:51,498 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-15 12:11:51,499 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-15 12:11:51,499 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-15 12:11:51,500 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-15 12:11:51,500 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-15 12:11:51,501 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-15 12:11:51,502 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-15 12:11:51,502 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-15 12:11:51,503 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-15 12:11:51,503 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-15 12:11:51,504 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-15 12:11:51,504 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-15 12:11:51,505 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-15 12:11:51,505 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-15 12:11:51,506 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-15 12:11:51,506 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-15 12:11:51,507 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-15 12:11:51,507 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-15 12:11:51,508 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-15 12:11:51,508 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-15 12:11:51,509 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-15 12:11:51,509 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-15 12:11:51,510 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-15 12:11:51,510 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-15 12:11:51,511 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-15 12:11:51,512 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-15 12:11:51,512 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-15 12:11:51,513 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-15 12:11:51,513 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-15 12:11:51,513 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-15 12:11:51,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-15 12:11:51,513 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-15 12:11:51,513 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-15 12:11:51,514 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-15 12:11:51,514 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-15 12:11:51,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-15 12:11:51,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-15 12:11:51,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-15 12:11:51,514 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-15 12:11:51,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:11:52,386 INFO L356 Elim1Store]: treesize reduction 27, result has 72.2 percent of original size [2022-04-15 12:11:52,387 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-15 12:11:52,730 INFO L290 TraceCheckUtils]: 71: Hoare triple {94663#false} assume !false; {94663#false} is VALID [2022-04-15 12:11:52,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {94663#false} assume 0 == ~cond; {94663#false} is VALID [2022-04-15 12:11:52,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {94663#false} ~cond := #in~cond; {94663#false} is VALID [2022-04-15 12:11:52,730 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-15 12:11:52,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {94663#false} assume !(0 != #t~mem11);havoc #t~mem11; {94663#false} is VALID [2022-04-15 12:11:52,730 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-15 12:11:52,730 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-15 12:11:52,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {94663#false} assume !(~j~0 % 4294967296 < 2); {94663#false} is VALID [2022-04-15 12:11:52,731 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-15 12:11:52,731 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-15 12:11:52,732 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-15 12:11:52,733 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-15 12:11:52,733 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-15 12:11:52,734 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-15 12:11:52,734 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-15 12:11:52,735 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-15 12:11:52,736 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-15 12:11:52,736 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-15 12:11:52,737 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-15 12:11:52,737 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-15 12:11:52,738 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-15 12:11:52,738 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-15 12:11:52,739 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-15 12:11:52,739 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-15 12:11:52,740 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-15 12:11:52,740 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-15 12:11:52,741 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-15 12:11:52,741 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-15 12:11:52,742 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-15 12:11:52,742 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-15 12:11:52,743 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-15 12:11:52,743 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-15 12:11:52,744 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-15 12:11:52,744 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-15 12:11:52,745 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-15 12:11:52,745 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-15 12:11:52,746 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-15 12:11:52,747 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-15 12:11:52,747 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-15 12:11:52,747 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-15 12:11:52,748 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-15 12:11:52,748 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-15 12:11:52,748 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-15 12:11:52,749 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-15 12:11:52,749 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-15 12:11:52,749 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-15 12:11:52,750 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-15 12:11:52,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {94662#true} assume !(0 != #t~mem4);havoc #t~mem4; {94662#true} is VALID [2022-04-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,750 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-15 12:11:52,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {94662#true} assume !(~i~0 % 4294967296 < 5); {94662#true} is VALID [2022-04-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,751 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-15 12:11:52,752 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-15 12:11:52,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {94662#true} call #t~ret17 := main(); {94662#true} is VALID [2022-04-15 12:11:52,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94662#true} {94662#true} #133#return; {94662#true} is VALID [2022-04-15 12:11:52,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {94662#true} assume true; {94662#true} is VALID [2022-04-15 12:11:52,752 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-15 12:11:52,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {94662#true} call ULTIMATE.init(); {94662#true} is VALID [2022-04-15 12:11:52,753 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-15 12:11:52,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956501742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:11:52,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:11:52,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 40 [2022-04-15 12:11:52,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:11:52,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418410013] [2022-04-15 12:11:52,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418410013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:11:52,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:11:52,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:11:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573049489] [2022-04-15 12:11:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:11:52,756 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-15 12:11:52,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:11:52,756 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-15 12:11:52,815 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-15 12:11:52,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:11:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:11:52,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:11:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:11:52,817 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-15 12:12:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:18,815 INFO L93 Difference]: Finished difference Result 1436 states and 1645 transitions. [2022-04-15 12:12:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:12:18,816 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-15 12:12:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:12:18,816 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-15 12:12:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-15 12:12:18,817 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-15 12:12:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-15 12:12:18,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2022-04-15 12:12:18,984 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-15 12:12:19,040 INFO L225 Difference]: With dead ends: 1436 [2022-04-15 12:12:19,040 INFO L226 Difference]: Without dead ends: 1236 [2022-04-15 12:12:19,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=462, Invalid=2730, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:12:19,041 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 238 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:12:19,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 97 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:12:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-15 12:12:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 948. [2022-04-15 12:12:33,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:12:33,031 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-15 12:12:33,031 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-15 12:12:33,032 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-15 12:12:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:33,082 INFO L93 Difference]: Finished difference Result 1236 states and 1400 transitions. [2022-04-15 12:12:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1400 transitions. [2022-04-15 12:12:33,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:12:33,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:12:33,084 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-15 12:12:33,084 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-15 12:12:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:12:33,146 INFO L93 Difference]: Finished difference Result 1236 states and 1400 transitions. [2022-04-15 12:12:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1400 transitions. [2022-04-15 12:12:33,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:12:33,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:12:33,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:12:33,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:12:33,148 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-15 12:12:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1082 transitions. [2022-04-15 12:12:33,207 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1082 transitions. Word has length 72 [2022-04-15 12:12:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:12:33,208 INFO L478 AbstractCegarLoop]: Abstraction has 948 states and 1082 transitions. [2022-04-15 12:12:33,208 INFO L479 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-15 12:12:33,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 948 states and 1082 transitions. [2022-04-15 12:12:39,968 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-15 12:12:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1082 transitions. [2022-04-15 12:12:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:12:39,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:12:39,969 INFO L499 BasicCegarLoop]: 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-15 12:12:39,986 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-15 12:12:40,170 WARN L460 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-15 12:12:40,170 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:12:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:12:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2132024177, now seen corresponding path program 29 times [2022-04-15 12:12:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:12:40,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325271823] [2022-04-15 12:12:40,178 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:12:40,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:12:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2132024177, now seen corresponding path program 30 times [2022-04-15 12:12:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:12:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726377102] [2022-04-15 12:12:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:12:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:12:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:12:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:40,383 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-15 12:12:40,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-15 12:12:40,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-15 12:12:40,384 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-15 12:12:40,384 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-15 12:12:40,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-15 12:12:40,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-15 12:12:40,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-15 12:12:40,384 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-15 12:12:40,384 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-15 12:12:40,384 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {102410#true} assume !(~i~0 % 4294967296 < 5); {102410#true} is VALID [2022-04-15 12:12:40,385 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-15 12:12:40,385 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-15 12:12:40,386 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-15 12:12:40,386 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-15 12:12:40,386 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-15 12:12:40,387 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-15 12:12:40,387 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-15 12:12:40,388 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-15 12:12:40,388 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-15 12:12:40,389 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-15 12:12:40,389 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-15 12:12:40,389 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-15 12:12:40,390 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-15 12:12:40,390 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-15 12:12:40,391 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-15 12:12:40,391 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-15 12:12:40,391 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-15 12:12:40,392 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-15 12:12:40,392 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-15 12:12:40,393 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-15 12:12:40,393 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-15 12:12:40,394 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-15 12:12:40,394 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-15 12:12:40,394 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-15 12:12:40,395 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-15 12:12:40,395 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-15 12:12:40,396 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-15 12:12:40,396 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-15 12:12:40,397 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-15 12:12:40,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {102411#false} ~i~0 := 0;~cont_aux~0 := 0; {102411#false} is VALID [2022-04-15 12:12:40,397 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-15 12:12:40,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {102411#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-15 12:12:40,397 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-15 12:12:40,397 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-15 12:12:40,397 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-15 12:12:40,397 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-15 12:12:40,397 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-15 12:12:40,397 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-15 12:12:40,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {102411#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {102411#false} is VALID [2022-04-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 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-15 12:12:40,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-15 12:12:40,398 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-15 12:12:40,399 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-15 12:12:40,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-15 12:12:40,399 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-15 12:12:40,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-15 12:12:40,399 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-15 12:12:40,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-15 12:12:40,399 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-15 12:12:40,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:12:40,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726377102] [2022-04-15 12:12:40,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726377102] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:12:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453127733] [2022-04-15 12:12:40,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:12:40,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:12:40,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:12:40,408 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-15 12:12:40,412 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-15 12:12:40,593 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:12:40,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:12:40,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:12:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:12:40,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:12:44,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-15 12:12:44,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-15 12:12:44,514 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-15 12:12:44,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {102410#true} call ULTIMATE.init(); {102410#true} is VALID [2022-04-15 12:12:44,617 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-15 12:12:44,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-15 12:12:44,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-15 12:12:44,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-15 12:12:44,631 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-15 12:12:44,631 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-15 12:12:44,631 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-15 12:12:44,632 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-15 12:12:44,632 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-15 12:12:44,632 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-15 12:12:44,633 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-15 12:12:44,633 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-15 12:12:44,633 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-15 12:12:44,634 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-15 12:12:44,634 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-15 12:12:44,634 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-15 12:12:44,634 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-15 12:12:44,635 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-15 12:12:44,635 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-15 12:12:44,635 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-15 12:12:44,636 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-15 12:12:44,636 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-15 12:12:44,637 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-15 12:12:44,637 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-15 12:12:44,638 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-15 12:12:44,638 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-15 12:12:44,638 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-15 12:12:44,639 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-15 12:12:44,639 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-15 12:12:44,639 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-15 12:12:44,640 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-15 12:12:44,640 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-15 12:12:44,640 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-15 12:12:44,641 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-15 12:12:44,641 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-15 12:12:44,642 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-15 12:12:44,642 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-15 12:12:44,643 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-15 12:12:44,643 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-15 12:12:44,644 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-15 12:12:44,644 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-15 12:12:44,645 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-15 12:12:44,645 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-15 12:12:44,646 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-15 12:12:44,651 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-15 12:12:44,659 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-15 12:12:44,667 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-15 12:12:44,675 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-15 12:12:44,683 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-15 12:12:44,687 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-15 12:12:44,688 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-15 12:12:44,689 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-15 12:12:44,690 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-15 12:12:44,690 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-15 12:12:44,691 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-15 12:12:44,692 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-15 12:12:44,693 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,694 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-15 12:12:44,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-15 12:12:44,695 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-15 12:12:44,695 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-15 12:12:44,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-15 12:12:44,695 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-15 12:12:44,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-15 12:12:44,695 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-15 12:12:44,695 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-15 12:12:44,696 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-15 12:12:44,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:12:45,387 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-04-15 12:12:45,387 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-15 12:12:45,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {102411#false} assume !false; {102411#false} is VALID [2022-04-15 12:12:45,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {102411#false} assume 0 == ~cond; {102411#false} is VALID [2022-04-15 12:12:45,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {102411#false} ~cond := #in~cond; {102411#false} is VALID [2022-04-15 12:12:45,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-15 12:12:45,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {102411#false} assume !(0 != #t~mem11);havoc #t~mem11; {102411#false} is VALID [2022-04-15 12:12:45,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-15 12:12:45,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-15 12:12:45,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {102411#false} assume !(~j~0 % 4294967296 < 2); {102411#false} is VALID [2022-04-15 12:12:45,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-15 12:12:45,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-15 12:12:45,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-15 12:12:45,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-15 12:12:45,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-15 12:12:45,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-15 12:12:45,435 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-15 12:12:45,435 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-15 12:12:45,436 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-15 12:12:45,436 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-15 12:12:45,437 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-15 12:12:45,437 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-15 12:12:45,437 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-15 12:12:45,438 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-15 12:12:45,438 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-15 12:12:45,439 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-15 12:12:45,439 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-15 12:12:45,439 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-15 12:12:45,440 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-15 12:12:45,440 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-15 12:12:45,441 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-15 12:12:45,441 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-15 12:12:45,441 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-15 12:12:45,442 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-15 12:12:45,442 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-15 12:12:45,442 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-15 12:12:45,443 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-15 12:12:45,443 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-15 12:12:45,443 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-15 12:12:45,444 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-15 12:12:45,444 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,445 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {102410#true} assume !(~i~0 % 4294967296 < 5); {102410#true} is VALID [2022-04-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,446 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-15 12:12:45,447 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-15 12:12:45,447 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-15 12:12:45,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {102410#true} call #t~ret17 := main(); {102410#true} is VALID [2022-04-15 12:12:45,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102410#true} {102410#true} #133#return; {102410#true} is VALID [2022-04-15 12:12:45,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {102410#true} assume true; {102410#true} is VALID [2022-04-15 12:12:45,447 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-15 12:12:45,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {102410#true} call ULTIMATE.init(); {102410#true} is VALID [2022-04-15 12:12:45,447 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-15 12:12:45,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453127733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:12:45,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:12:45,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-04-15 12:12:45,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:12:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325271823] [2022-04-15 12:12:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325271823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:12:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:12:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:12:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160631219] [2022-04-15 12:12:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:12:45,448 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-15 12:12:45,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:12:45,449 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-15 12:12:45,482 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-15 12:12:45,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:12:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:12:45,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:12:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:12:45,483 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-15 12:13:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:13:40,979 INFO L93 Difference]: Finished difference Result 3393 states and 3886 transitions. [2022-04-15 12:13:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:13:40,979 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-15 12:13:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:13:40,979 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-15 12:13:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-04-15 12:13:40,993 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-15 12:13:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-04-15 12:13:40,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 239 transitions. [2022-04-15 12:13:41,221 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-15 12:13:41,920 INFO L225 Difference]: With dead ends: 3393 [2022-04-15 12:13:41,920 INFO L226 Difference]: Without dead ends: 3344 [2022-04-15 12:13:41,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:13:41,923 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 316 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:13:41,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 165 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:13:41,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-04-15 12:14:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 950. [2022-04-15 12:14:00,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:14:00,014 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-15 12:14:00,015 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-15 12:14:00,016 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-15 12:14:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:00,538 INFO L93 Difference]: Finished difference Result 3344 states and 3830 transitions. [2022-04-15 12:14:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 3830 transitions. [2022-04-15 12:14:00,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:00,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:00,543 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-15 12:14:00,543 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-15 12:14:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:01,085 INFO L93 Difference]: Finished difference Result 3344 states and 3830 transitions. [2022-04-15 12:14:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 3830 transitions. [2022-04-15 12:14:01,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:14:01,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:14:01,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:14:01,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:14:01,090 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-15 12:14:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1085 transitions. [2022-04-15 12:14:01,147 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1085 transitions. Word has length 73 [2022-04-15 12:14:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:14:01,147 INFO L478 AbstractCegarLoop]: Abstraction has 950 states and 1085 transitions. [2022-04-15 12:14:01,147 INFO L479 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-15 12:14:01,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 950 states and 1085 transitions. [2022-04-15 12:14:09,586 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-15 12:14:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1085 transitions. [2022-04-15 12:14:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:14:09,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:14:09,588 INFO L499 BasicCegarLoop]: 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-15 12:14:09,615 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-15 12:14:09,789 WARN L460 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-15 12:14:09,789 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:14:09,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:14:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1623991599, now seen corresponding path program 31 times [2022-04-15 12:14:09,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:14:09,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003801721] [2022-04-15 12:14:09,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:14:09,795 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:14:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1623991599, now seen corresponding path program 32 times [2022-04-15 12:14:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:14:09,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414920150] [2022-04-15 12:14:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:14:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:14:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:14:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:10,049 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-15 12:14:10,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-15 12:14:10,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-15 12:14:10,050 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-15 12:14:10,050 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-15 12:14:10,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-15 12:14:10,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-15 12:14:10,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,051 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-15 12:14:10,052 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-15 12:14:10,052 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-15 12:14:10,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {118277#true} assume !(~i~0 % 4294967296 < 5); {118277#true} is VALID [2022-04-15 12:14:10,052 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-15 12:14:10,052 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-15 12:14:10,052 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-15 12:14:10,053 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-15 12:14:10,053 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-15 12:14:10,054 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-15 12:14:10,054 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-15 12:14:10,055 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-15 12:14:10,055 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-15 12:14:10,056 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-15 12:14:10,056 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-15 12:14:10,057 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-15 12:14:10,057 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-15 12:14:10,058 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-15 12:14:10,058 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-15 12:14:10,059 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-15 12:14:10,059 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-15 12:14:10,060 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-15 12:14:10,060 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-15 12:14:10,061 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-15 12:14:10,061 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-15 12:14:10,062 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-15 12:14:10,062 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-15 12:14:10,063 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-15 12:14:10,079 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-15 12:14:10,080 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-15 12:14:10,080 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-15 12:14:10,081 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-15 12:14:10,082 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-15 12:14:10,082 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-15 12:14:10,082 INFO L290 TraceCheckUtils]: 47: Hoare triple {118278#false} ~i~0 := 0;~cont_aux~0 := 0; {118278#false} is VALID [2022-04-15 12:14:10,083 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-15 12:14:10,083 INFO L290 TraceCheckUtils]: 49: Hoare triple {118278#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118278#false} is VALID [2022-04-15 12:14:10,083 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-15 12:14:10,083 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-15 12:14:10,083 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-15 12:14:10,083 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-15 12:14:10,083 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-15 12:14:10,083 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-15 12:14:10,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {118278#false} assume !(~j~0 % 4294967296 < 2); {118278#false} is VALID [2022-04-15 12:14:10,083 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-15 12:14:10,084 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-15 12:14:10,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {118278#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {118278#false} is VALID [2022-04-15 12:14:10,084 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-15 12:14:10,084 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-15 12:14:10,084 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-15 12:14:10,084 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-15 12:14:10,084 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-15 12:14:10,084 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-15 12:14:10,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {118278#false} assume !(~j~0 % 4294967296 < 2); {118278#false} is VALID [2022-04-15 12:14:10,084 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-15 12:14:10,085 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-15 12:14:10,085 INFO L290 TraceCheckUtils]: 69: Hoare triple {118278#false} assume !(0 != #t~mem11);havoc #t~mem11; {118278#false} is VALID [2022-04-15 12:14:10,085 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-15 12:14:10,085 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-15 12:14:10,085 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-15 12:14:10,085 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-15 12:14:10,085 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-15 12:14:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:14:10,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414920150] [2022-04-15 12:14:10,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414920150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:14:10,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96068482] [2022-04-15 12:14:10,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:14:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:14:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:14:10,087 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-15 12:14:10,119 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-15 12:14:10,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:14:10,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:14:10,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:14:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:14:10,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:14:11,111 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-15 12:14:11,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {118277#true} call ULTIMATE.init(); {118277#true} is VALID [2022-04-15 12:14:11,134 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-15 12:14:11,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-15 12:14:11,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-15 12:14:11,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-15 12:14:11,135 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-15 12:14:11,136 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-15 12:14:11,136 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-15 12:14:11,137 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-15 12:14:11,137 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-15 12:14:11,138 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-15 12:14:11,138 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-15 12:14:11,138 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-15 12:14:11,138 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-15 12:14:11,139 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-15 12:14:11,139 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-15 12:14:11,140 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-15 12:14:11,140 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-15 12:14:11,140 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-15 12:14:11,141 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-15 12:14:11,141 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-15 12:14:11,142 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-15 12:14:11,142 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-15 12:14:11,143 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-15 12:14:11,143 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-15 12:14:11,144 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-15 12:14:11,144 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-15 12:14:11,144 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-15 12:14:11,145 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-15 12:14:11,145 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-15 12:14:11,146 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-15 12:14:11,146 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-15 12:14:11,147 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-15 12:14:11,147 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-15 12:14:11,148 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-15 12:14:11,148 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-15 12:14:11,149 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-15 12:14:11,149 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-15 12:14:11,150 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-15 12:14:11,150 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-15 12:14:11,150 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-15 12:14:11,151 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-15 12:14:11,151 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-15 12:14:11,152 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-15 12:14:11,152 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-15 12:14:11,153 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-15 12:14:11,153 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-15 12:14:11,154 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-15 12:14:11,154 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-15 12:14:11,154 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-15 12:14:11,155 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-15 12:14:11,156 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-15 12:14:11,156 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-15 12:14:11,157 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-15 12:14:11,157 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-15 12:14:11,157 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-15 12:14:11,158 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-15 12:14:11,158 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-15 12:14:11,159 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-15 12:14:11,159 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-15 12:14:11,160 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-15 12:14:11,160 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-15 12:14:11,161 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-15 12:14:11,161 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-15 12:14:11,162 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-15 12:14:11,162 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-15 12:14:11,163 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-15 12:14:11,163 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-15 12:14:11,164 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-15 12:14:11,164 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-15 12:14:11,164 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-15 12:14:11,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-15 12:14:11,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-15 12:14:11,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-15 12:14:11,165 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-15 12:14:11,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:14:11,470 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:14:11,470 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-15 12:14:11,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {118278#false} assume !false; {118278#false} is VALID [2022-04-15 12:14:11,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {118278#false} assume 0 == ~cond; {118278#false} is VALID [2022-04-15 12:14:11,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {118278#false} ~cond := #in~cond; {118278#false} is VALID [2022-04-15 12:14:11,587 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-15 12:14:11,587 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-15 12:14:11,588 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-15 12:14:11,589 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-15 12:14:11,589 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-15 12:14:11,590 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-15 12:14:11,590 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-15 12:14:11,591 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-15 12:14:11,591 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-15 12:14:11,591 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-15 12:14:11,592 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-15 12:14:11,592 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-15 12:14:11,593 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-15 12:14:11,594 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-15 12:14:11,594 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-15 12:14:11,595 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-15 12:14:11,595 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-15 12:14:11,595 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-15 12:14:11,596 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-15 12:14:11,596 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-15 12:14:11,596 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-15 12:14:11,597 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-15 12:14:11,597 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-15 12:14:11,598 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-15 12:14:11,598 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-15 12:14:11,598 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-15 12:14:11,599 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-15 12:14:11,599 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-15 12:14:11,599 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-15 12:14:11,600 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-15 12:14:11,600 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-15 12:14:11,600 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-15 12:14:11,601 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-15 12:14:11,601 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-15 12:14:11,601 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-15 12:14:11,602 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-15 12:14:11,602 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-15 12:14:11,602 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-15 12:14:11,603 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-15 12:14:11,603 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-15 12:14:11,603 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-15 12:14:11,604 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-15 12:14:11,604 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-15 12:14:11,604 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-15 12:14:11,605 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-15 12:14:11,605 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-15 12:14:11,606 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-15 12:14:11,606 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-15 12:14:11,607 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-15 12:14:11,607 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-15 12:14:11,608 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-15 12:14:11,608 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-15 12:14:11,609 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-15 12:14:11,609 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-15 12:14:11,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {118277#true} assume !(~i~0 % 4294967296 < 5); {118277#true} is VALID [2022-04-15 12:14:11,609 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-15 12:14:11,609 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-15 12:14:11,609 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-15 12:14:11,609 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-15 12:14:11,609 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-15 12:14:11,610 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-15 12:14:11,610 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-15 12:14:11,610 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-15 12:14:11,610 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-15 12:14:11,610 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-15 12:14:11,610 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-15 12:14:11,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {118277#true} call #t~ret17 := main(); {118277#true} is VALID [2022-04-15 12:14:11,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118277#true} {118277#true} #133#return; {118277#true} is VALID [2022-04-15 12:14:11,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {118277#true} assume true; {118277#true} is VALID [2022-04-15 12:14:11,610 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-15 12:14:11,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {118277#true} call ULTIMATE.init(); {118277#true} is VALID [2022-04-15 12:14:11,611 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-15 12:14:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96068482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:14:11,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:14:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 31 [2022-04-15 12:14:11,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:14:11,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003801721] [2022-04-15 12:14:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003801721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:14:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:14:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:14:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154290046] [2022-04-15 12:14:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:14:11,614 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-15 12:14:11,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:14:11,614 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-15 12:14:11,654 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-15 12:14:11,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:14:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:14:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:14:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:14:11,655 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-15 12:14:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:14:50,483 INFO L93 Difference]: Finished difference Result 1934 states and 2199 transitions. [2022-04-15 12:14:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:14:50,483 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-15 12:14:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:14:50,484 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-15 12:14:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2022-04-15 12:14:50,485 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-15 12:14:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2022-04-15 12:14:50,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2022-04-15 12:14:50,664 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-15 12:14:50,855 INFO L225 Difference]: With dead ends: 1934 [2022-04-15 12:14:50,855 INFO L226 Difference]: Without dead ends: 1809 [2022-04-15 12:14:50,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:14:50,874 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 238 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:14:50,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 81 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:14:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-04-15 12:15:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1032. [2022-04-15 12:15:10,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:15:10,852 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-15 12:15:10,853 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-15 12:15:10,854 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-15 12:15:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:10,992 INFO L93 Difference]: Finished difference Result 1809 states and 2058 transitions. [2022-04-15 12:15:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2058 transitions. [2022-04-15 12:15:10,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:10,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:10,996 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-15 12:15:10,998 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-15 12:15:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:15:11,144 INFO L93 Difference]: Finished difference Result 1809 states and 2058 transitions. [2022-04-15 12:15:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2058 transitions. [2022-04-15 12:15:11,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:15:11,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:15:11,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:15:11,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:15:11,148 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-15 12:15:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1175 transitions. [2022-04-15 12:15:11,231 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1175 transitions. Word has length 74 [2022-04-15 12:15:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:15:11,232 INFO L478 AbstractCegarLoop]: Abstraction has 1032 states and 1175 transitions. [2022-04-15 12:15:11,232 INFO L479 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-15 12:15:11,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1032 states and 1175 transitions. [2022-04-15 12:15:20,325 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-15 12:15:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1175 transitions. [2022-04-15 12:15:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:15:20,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:15:20,327 INFO L499 BasicCegarLoop]: 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-15 12:15:20,352 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-15 12:15:20,528 WARN L460 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-15 12:15:20,528 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:15:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:15:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 583415094, now seen corresponding path program 33 times [2022-04-15 12:15:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022855506] [2022-04-15 12:15:20,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:15:20,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:15:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 583415094, now seen corresponding path program 34 times [2022-04-15 12:15:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:15:20,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750543528] [2022-04-15 12:15:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:15:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:15:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:15:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:20,850 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-15 12:15:20,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-15 12:15:20,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-15 12:15:20,851 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-15 12:15:20,851 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-15 12:15:20,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-15 12:15:20,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-15 12:15:20,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-15 12:15:20,851 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-15 12:15:20,851 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-15 12:15:20,851 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-15 12:15:20,851 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {128322#true} assume !(~i~0 % 4294967296 < 5); {128322#true} is VALID [2022-04-15 12:15:20,852 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-15 12:15:20,852 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-15 12:15:20,853 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-15 12:15:20,853 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-15 12:15:20,854 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-15 12:15:20,854 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-15 12:15:20,855 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-15 12:15:20,855 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-15 12:15:20,856 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-15 12:15:20,856 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-15 12:15:20,857 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-15 12:15:20,858 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-15 12:15:20,859 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-15 12:15:20,860 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-15 12:15:20,860 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-15 12:15:20,861 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-15 12:15:20,861 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-15 12:15:20,862 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-15 12:15:20,863 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-15 12:15:20,863 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-15 12:15:20,864 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-15 12:15:20,864 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-15 12:15:20,865 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-15 12:15:20,865 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-15 12:15:20,866 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-15 12:15:20,866 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-15 12:15:20,868 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-15 12:15:20,868 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-15 12:15:20,869 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-15 12:15:20,869 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-15 12:15:20,870 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-15 12:15:20,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {128323#false} ~i~0 := 0;~cont_aux~0 := 0; {128323#false} is VALID [2022-04-15 12:15:20,870 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-15 12:15:20,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {128323#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128323#false} is VALID [2022-04-15 12:15:20,870 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-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {128323#false} assume !(~j~0 % 4294967296 < 2); {128323#false} is VALID [2022-04-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {128323#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {128323#false} is VALID [2022-04-15 12:15:20,871 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-15 12:15:20,871 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-15 12:15:20,872 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-15 12:15:20,872 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-15 12:15:20,872 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-15 12:15:20,872 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-15 12:15:20,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {128323#false} assume !(~j~0 % 4294967296 < 2); {128323#false} is VALID [2022-04-15 12:15:20,872 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-15 12:15:20,872 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-15 12:15:20,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {128323#false} assume !(0 != #t~mem11);havoc #t~mem11; {128323#false} is VALID [2022-04-15 12:15:20,872 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-15 12:15:20,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-15 12:15:20,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-15 12:15:20,873 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-15 12:15:20,873 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-15 12:15:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:15:20,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750543528] [2022-04-15 12:15:20,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750543528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:15:20,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700693673] [2022-04-15 12:15:20,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:15:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:15:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:15:20,876 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-15 12:15:20,906 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-15 12:15:21,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:15:21,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:15:21,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:15:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:15:21,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:15:21,637 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-15 12:15:21,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {128322#true} call ULTIMATE.init(); {128322#true} is VALID [2022-04-15 12:15:21,658 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-15 12:15:21,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-15 12:15:21,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-15 12:15:21,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-15 12:15:21,659 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-15 12:15:21,660 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-15 12:15:21,660 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-15 12:15:21,660 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-15 12:15:21,661 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-15 12:15:21,661 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-15 12:15:21,661 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-15 12:15:21,661 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-15 12:15:21,662 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-15 12:15:21,662 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-15 12:15:21,662 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-15 12:15:21,663 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-15 12:15:21,663 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-15 12:15:21,663 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-15 12:15:21,664 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-15 12:15:21,664 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-15 12:15:21,664 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-15 12:15:21,665 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-15 12:15:21,665 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-15 12:15:21,665 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-15 12:15:21,666 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-15 12:15:21,666 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-15 12:15:21,667 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-15 12:15:21,667 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-15 12:15:21,667 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-15 12:15:21,668 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-15 12:15:21,668 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-15 12:15:21,669 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-15 12:15:21,669 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-15 12:15:21,670 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-15 12:15:21,670 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-15 12:15:21,671 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-15 12:15:21,671 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-15 12:15:21,671 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-15 12:15:21,672 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-15 12:15:21,672 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-15 12:15:21,672 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-15 12:15:21,673 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-15 12:15:21,673 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-15 12:15:21,674 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-15 12:15:21,674 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-15 12:15:21,674 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-15 12:15:21,675 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-15 12:15:21,675 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-15 12:15:21,676 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-15 12:15:21,676 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-15 12:15:21,676 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-15 12:15:21,677 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-15 12:15:21,677 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-15 12:15:21,678 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-15 12:15:21,678 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-15 12:15:21,678 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-15 12:15:21,679 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-15 12:15:21,679 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-15 12:15:21,680 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-15 12:15:21,680 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-15 12:15:21,681 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-15 12:15:21,681 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-15 12:15:21,682 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-15 12:15:21,682 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-15 12:15:21,683 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-15 12:15:21,683 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-15 12:15:21,683 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-15 12:15:21,684 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-15 12:15:21,684 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-15 12:15:21,684 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-15 12:15:21,684 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-15 12:15:21,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-15 12:15:21,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-15 12:15:21,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-15 12:15:21,685 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-15 12:15:21,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:15:21,965 INFO L356 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-04-15 12:15:21,965 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-15 12:15:22,071 INFO L290 TraceCheckUtils]: 74: Hoare triple {128323#false} assume !false; {128323#false} is VALID [2022-04-15 12:15:22,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {128323#false} assume 0 == ~cond; {128323#false} is VALID [2022-04-15 12:15:22,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {128323#false} ~cond := #in~cond; {128323#false} is VALID [2022-04-15 12:15:22,072 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-15 12:15:22,072 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-15 12:15:22,073 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-15 12:15:22,074 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-15 12:15:22,074 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-15 12:15:22,075 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-15 12:15:22,075 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-15 12:15:22,075 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-15 12:15:22,076 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-15 12:15:22,076 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-15 12:15:22,077 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-15 12:15:22,077 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-15 12:15:22,077 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-15 12:15:22,078 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-15 12:15:22,078 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-15 12:15:22,079 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-15 12:15:22,079 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-15 12:15:22,079 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-15 12:15:22,079 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-15 12:15:22,080 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-15 12:15:22,080 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-15 12:15:22,080 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-15 12:15:22,081 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-15 12:15:22,081 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-15 12:15:22,081 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-15 12:15:22,082 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-15 12:15:22,082 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-15 12:15:22,082 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-15 12:15:22,082 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-15 12:15:22,083 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-15 12:15:22,083 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-15 12:15:22,083 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-15 12:15:22,084 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-15 12:15:22,084 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-15 12:15:22,084 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-15 12:15:22,084 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-15 12:15:22,085 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-15 12:15:22,085 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-15 12:15:22,085 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-15 12:15:22,085 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-15 12:15:22,086 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-15 12:15:22,086 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-15 12:15:22,086 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-15 12:15:22,087 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-15 12:15:22,087 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-15 12:15:22,087 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-15 12:15:22,087 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-15 12:15:22,088 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-15 12:15:22,088 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-15 12:15:22,089 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-15 12:15:22,089 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-15 12:15:22,090 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-15 12:15:22,090 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-15 12:15:22,090 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-15 12:15:22,090 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-15 12:15:22,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {128322#true} assume !(~i~0 % 4294967296 < 5); {128322#true} is VALID [2022-04-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 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-15 12:15:22,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {128322#true} call #t~ret17 := main(); {128322#true} is VALID [2022-04-15 12:15:22,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128322#true} {128322#true} #133#return; {128322#true} is VALID [2022-04-15 12:15:22,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {128322#true} assume true; {128322#true} is VALID [2022-04-15 12:15:22,092 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-15 12:15:22,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {128322#true} call ULTIMATE.init(); {128322#true} is VALID [2022-04-15 12:15:22,092 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-15 12:15:22,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700693673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:15:22,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:15:22,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 34 [2022-04-15 12:15:22,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:15:22,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022855506] [2022-04-15 12:15:22,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022855506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:15:22,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:15:22,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:15:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295230963] [2022-04-15 12:15:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:15:22,093 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-15 12:15:22,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:15:22,094 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-15 12:15:22,130 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-15 12:15:22,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:15:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:15:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:15:22,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:15:22,131 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-15 12:16:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:28,304 INFO L93 Difference]: Finished difference Result 3883 states and 4447 transitions. [2022-04-15 12:16:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:16:28,305 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-15 12:16:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:28,305 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-15 12:16:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 262 transitions. [2022-04-15 12:16:28,307 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-15 12:16:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 262 transitions. [2022-04-15 12:16:28,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 262 transitions. [2022-04-15 12:16:28,557 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-15 12:16:29,453 INFO L225 Difference]: With dead ends: 3883 [2022-04-15 12:16:29,453 INFO L226 Difference]: Without dead ends: 3834 [2022-04-15 12:16:29,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:16:29,456 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 346 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:29,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 189 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:16:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-04-15 12:16:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 1034. [2022-04-15 12:16:50,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:50,971 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-15 12:16:50,972 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-15 12:16:50,973 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-15 12:16:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:51,645 INFO L93 Difference]: Finished difference Result 3834 states and 4391 transitions. [2022-04-15 12:16:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4391 transitions. [2022-04-15 12:16:51,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:51,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:51,653 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-15 12:16:51,654 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-15 12:16:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:52,290 INFO L93 Difference]: Finished difference Result 3834 states and 4391 transitions. [2022-04-15 12:16:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4391 transitions. [2022-04-15 12:16:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:52,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:52,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:52,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:52,297 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-15 12:16:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1178 transitions. [2022-04-15 12:16:52,363 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1178 transitions. Word has length 75 [2022-04-15 12:16:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:52,363 INFO L478 AbstractCegarLoop]: Abstraction has 1034 states and 1178 transitions. [2022-04-15 12:16:52,364 INFO L479 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-15 12:16:52,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1034 states and 1178 transitions. [2022-04-15 12:17:02,459 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-15 12:17:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1178 transitions. [2022-04-15 12:17:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 12:17:02,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:02,461 INFO L499 BasicCegarLoop]: 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-15 12:17:02,487 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-15 12:17:02,661 WARN L460 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-15 12:17:02,661 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1908734380, now seen corresponding path program 35 times [2022-04-15 12:17:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380600440] [2022-04-15 12:17:02,668 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:17:02,668 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:17:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1908734380, now seen corresponding path program 36 times [2022-04-15 12:17:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694385458] [2022-04-15 12:17:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,965 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-15 12:17:02,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 12:17:02,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 12:17:02,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-15 12:17:02,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,966 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-15 12:17:02,967 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-15 12:17:02,967 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-15 12:17:02,967 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-15 12:17:02,967 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-15 12:17:02,967 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-15 12:17:02,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {146334#true} assume !(~i~0 % 4294967296 < 5); {146334#true} is VALID [2022-04-15 12:17:02,967 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-15 12:17:02,967 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-15 12:17:02,968 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-15 12:17:02,968 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-15 12:17:02,969 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-15 12:17:02,969 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-15 12:17:02,970 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-15 12:17:02,970 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-15 12:17:02,971 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-15 12:17:02,971 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-15 12:17:02,972 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-15 12:17:02,972 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-15 12:17:02,973 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-15 12:17:02,973 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-15 12:17:02,974 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-15 12:17:02,975 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-15 12:17:02,975 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-15 12:17:02,976 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-15 12:17:02,976 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-15 12:17:02,977 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-15 12:17:02,977 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-15 12:17:02,977 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-15 12:17:02,978 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-15 12:17:02,979 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-15 12:17:02,979 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-15 12:17:02,980 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-15 12:17:02,980 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-15 12:17:02,981 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-15 12:17:02,981 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-15 12:17:02,982 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-15 12:17:02,982 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-15 12:17:02,983 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-15 12:17:02,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {146335#false} ~i~0 := 0;~cont_aux~0 := 0; {146335#false} is VALID [2022-04-15 12:17:02,983 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-15 12:17:02,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {146335#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146335#false} is VALID [2022-04-15 12:17:02,983 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {146335#false} assume !(~j~0 % 4294967296 < 2); {146335#false} is VALID [2022-04-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {146335#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {146335#false} is VALID [2022-04-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,984 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-15 12:17:02,985 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-15 12:17:02,985 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-15 12:17:02,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {146335#false} assume !(~j~0 % 4294967296 < 2); {146335#false} is VALID [2022-04-15 12:17:02,985 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-15 12:17:02,985 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-15 12:17:02,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {146335#false} assume !(0 != #t~mem11);havoc #t~mem11; {146335#false} is VALID [2022-04-15 12:17:02,985 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-15 12:17:02,985 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-15 12:17:02,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-15 12:17:02,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-15 12:17:02,986 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-15 12:17:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694385458] [2022-04-15 12:17:02,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694385458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975173796] [2022-04-15 12:17:02,986 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:02,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:02,987 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-15 12:17:02,989 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-15 12:17:03,219 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:17:03,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:03,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 12:17:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:03,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:03,332 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-15 12:17:03,892 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-15 12:17:03,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146334#true} is VALID [2022-04-15 12:17:03,926 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-15 12:17:03,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 12:17:03,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-15 12:17:03,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-15 12:17:03,927 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-15 12:17:03,928 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-15 12:17:03,928 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-15 12:17:03,929 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-15 12:17:03,929 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-15 12:17:03,929 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-15 12:17:03,930 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-15 12:17:03,930 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-15 12:17:03,931 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-15 12:17:03,931 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-15 12:17:03,931 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-15 12:17:03,932 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-15 12:17:03,932 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-15 12:17:03,932 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-15 12:17:03,933 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-15 12:17:03,933 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-15 12:17:03,934 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-15 12:17:03,934 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-15 12:17:03,935 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-15 12:17:03,935 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-15 12:17:03,936 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-15 12:17:03,936 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-15 12:17:03,936 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-15 12:17:03,937 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-15 12:17:03,937 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-15 12:17:03,938 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-15 12:17:03,938 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-15 12:17:03,939 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-15 12:17:03,939 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-15 12:17:03,940 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-15 12:17:03,940 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-15 12:17:03,941 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-15 12:17:03,941 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-15 12:17:03,942 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-15 12:17:03,942 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-15 12:17:03,943 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-15 12:17:03,943 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-15 12:17:03,944 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-15 12:17:03,944 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-15 12:17:03,945 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-15 12:17:03,945 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-15 12:17:03,945 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-15 12:17:03,946 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-15 12:17:03,946 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-15 12:17:03,947 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-15 12:17:03,947 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-15 12:17:03,948 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-15 12:17:03,948 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-15 12:17:03,949 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-15 12:17:03,949 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-15 12:17:03,950 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-15 12:17:03,950 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-15 12:17:03,951 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-15 12:17:03,951 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-15 12:17:03,952 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-15 12:17:03,952 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-15 12:17:03,953 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-15 12:17:03,953 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-15 12:17:03,954 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-15 12:17:03,954 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-15 12:17:03,954 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-15 12:17:03,955 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-15 12:17:03,955 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-15 12:17:03,956 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-15 12:17:03,956 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-15 12:17:03,957 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-15 12:17:03,957 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-15 12:17:03,957 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-15 12:17:03,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-15 12:17:03,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-15 12:17:03,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-15 12:17:03,958 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-15 12:17:03,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:04,405 INFO L290 TraceCheckUtils]: 75: Hoare triple {146335#false} assume !false; {146335#false} is VALID [2022-04-15 12:17:04,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {146335#false} assume 0 == ~cond; {146335#false} is VALID [2022-04-15 12:17:04,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {146335#false} ~cond := #in~cond; {146335#false} is VALID [2022-04-15 12:17:04,405 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-15 12:17:04,406 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-15 12:17:04,406 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-15 12:17:04,407 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-15 12:17:04,407 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-15 12:17:04,408 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-15 12:17:04,408 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-15 12:17:04,409 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-15 12:17:04,409 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-15 12:17:04,410 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-15 12:17:04,410 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-15 12:17:04,411 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-15 12:17:04,411 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-15 12:17:04,412 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-15 12:17:04,412 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-15 12:17:04,413 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-15 12:17:04,413 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-15 12:17:04,413 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-15 12:17:04,414 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-15 12:17:04,414 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-15 12:17:04,414 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-15 12:17:04,415 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-15 12:17:04,415 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-15 12:17:04,415 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-15 12:17:04,416 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-15 12:17:04,416 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-15 12:17:04,416 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-15 12:17:04,417 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-15 12:17:04,417 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-15 12:17:04,417 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-15 12:17:04,418 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-15 12:17:04,418 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-15 12:17:04,418 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-15 12:17:04,419 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-15 12:17:04,419 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-15 12:17:04,419 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-15 12:17:04,420 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-15 12:17:04,420 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-15 12:17:04,420 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-15 12:17:04,421 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-15 12:17:04,421 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-15 12:17:04,421 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-15 12:17:04,422 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-15 12:17:04,422 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-15 12:17:04,423 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-15 12:17:04,423 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-15 12:17:04,423 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-15 12:17:04,424 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-15 12:17:04,424 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-15 12:17:04,424 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-15 12:17:04,426 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-15 12:17:04,426 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-15 12:17:04,427 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-15 12:17:04,428 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-15 12:17:04,428 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-15 12:17:04,428 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-15 12:17:04,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {146334#true} assume !(~i~0 % 4294967296 < 5); {146334#true} is VALID [2022-04-15 12:17:04,428 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-15 12:17:04,428 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 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-15 12:17:04,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {146334#true} call #t~ret17 := main(); {146334#true} is VALID [2022-04-15 12:17:04,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146334#true} {146334#true} #133#return; {146334#true} is VALID [2022-04-15 12:17:04,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {146334#true} assume true; {146334#true} is VALID [2022-04-15 12:17:04,439 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-15 12:17:04,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {146334#true} call ULTIMATE.init(); {146334#true} is VALID [2022-04-15 12:17:04,440 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-15 12:17:04,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975173796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:04,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:04,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 32 [2022-04-15 12:17:04,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380600440] [2022-04-15 12:17:04,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380600440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:04,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:04,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:17:04,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659847419] [2022-04-15 12:17:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:04,441 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-15 12:17:04,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:04,441 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-15 12:17:04,508 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-15 12:17:04,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:17:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:17:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:17:04,509 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)